Number of the day: 426

Properties of the number 426:

426 = 2 × 3 × 71 is a sphenic number and squarefree.
426 has 3 distinct prime factors, 8 divisors, 5 antidivisors and 140 totatives.
426 has an oblong digit sum 12 in base 10.
426 is the difference of 2 positive pentagonal numbers in 2 ways.
426 = 4² + 11² + 17² is the sum of 3 positive squares.
426² is the sum of 3 positive squares.
426 is a divisor of 283² - 1.
426 = '4' + '26' is the concatenation of 2 semiprime numbers.
426 = '42' + '6' is the concatenation of 2 oblong numbers.
426 is palindromic in (at least) the following bases: 17, 70, -4, -25, and -85.
426 in base 4 = 12222 and consists of only the digits '1' and '2'.
426 in base 14 = 226 and consists of only the digits '2' and '6'.
426 in base 16 = 1aa and consists of only the digits '1' and 'a'.
426 in base 17 = 181 and consists of only the digits '1' and '8'.
426 in base 20 = 116 and consists of only the digits '1' and '6'.

The number 426 belongs to the following On-Line Encyclopedia of Integer Sequences (OEIS) sequences (among others):

Sequence numbers and descriptions below are taken from OEIS.
A005114: Untouchable numbers, also called nonaliquot numbers: impossible values for sum of aliquot parts of n (A001065).
A006314: Numbers n such that n^8 + 1 is prime.
A007304: Sphenic numbers: products of 3 distinct primes.
A007588: Stella octangula numbers: a(n) = n*(2*n^2 - 1).
A074664: Number of algebraically independent elements of degree n in the algebra of symmetric polynomials in noncommuting variables.
A145271: Coefficients for expansion of (g(x)d/dx)^n g(x); refined Eulerian numbers for calculating compositional inverse of h(x)= (d/dx)^(-1) 1/g(x); iterated derivatives as infinitesimal generators of flows.
A163334: Hilbert II curve in N x N grid, starting rightwards from the top-left corner, listed antidiagonally as A(0,0), A(0,1), A(1,0), A(0,2), A(1,1), A(2,0), ...
A235151: Numbers whose sum of digits is 12.
A255411: Shift factorial base representation of n one digit left (with 0 added to right), increment all nonzero digits by one, then convert back to decimal; Numbers with no digit 1 in their factorial base representation.
A259934: Infinite sequence starting with a(0)=0 such that A049820(a(k)) = a(k-1) for all k>=1, where A049820(n) = n - (number of divisors of n).