426
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 864
- Proper Divisor Sum (Aliquot Sum)
- 438
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- yes
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 140
- Möbius Function
- -1
- Radical
- 426
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 14
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Names
- German
- vierhundertsechsundzwanzig· ordinal: vierhundertsechsundzwanzigste
- English
- four hundred twenty-six· ordinal: four hundred twenty-sixth
- Spanish
- cuatrocientos veintiséis· ordinal: 426º
- French
- quatre cent vingt-six· ordinal: quatre cent vingt-sixième
- Italian
- quattrocentoventisei· ordinal: 426º
- Latin
- quadringenti viginti sex· ordinal: 426.
- Portuguese
- quatrocentos e vinte e seis· ordinal: 426º
Appears in sequences
- Numbers beginning with letter 'f' in English.at n=50A000867
- 3rd differences of factorial numbers.at n=3A001565
- G.f.: -1 + Product_{k>=1} (1 + prime(k)*x^prime(k)).at n=20A002099
- G.f.: -1 + Product_{k>=1} (1 + prime(k)*x^prime(k)).at n=22A002099
- a(n) = a(n-1) + a(n-2) - a(n-3).at n=16A002798
- Numbers that are the sum of 11 positive 4th powers.at n=53A003345
- Inconsummate numbers in base 10: no number is this multiple of the sum of its digits (in base 10).at n=26A003635
- Cubes written in base 7.at n=5A004637
- Cubes written in base 11. (Next term contains a non-decimal character.)at n=7A004640
- Untouchable numbers, also called nonaliquot numbers: impossible values for the sum of aliquot parts function (A001065).at n=32A005114
- a(n) is the number of alpha-labelings of graphs with n edges.at n=6A005193
- Representation degeneracies for Ramond strings.at n=12A005303
- 1 + (sum of first n odd primes - n)/2.at n=22A005521
- Start with 4; if k appears then so do 2k+2 and 3k+3. (duplicates omitted.)at n=46A005662
- Numbers k such that k^8 + 1 is prime.at n=15A006314
- Largest inverse of totient function (A000010): a(n) is the largest x such that phi(x) = m, where m = A002202(n) is the n-th number in the range of phi.at n=52A006511
- Restricted postage stamp problem with n denominations and 2 stamps.at n=34A006638
- Number of n-step spirals on cubic lattice.at n=5A006779
- Let P(n) of a sequence s(1),s(2),s(3),... be obtained by leaving s(1),...,s(n) fixed and reversing every n consecutive terms thereafter; apply P(2) to 1,2,3,... to get PS(2), then apply P(3) to PS(2) to get PS(3), then apply P(4) to PS(3), etc. This sequence is the limit of PS(n).at n=41A007062
- Sphenic numbers: products of 3 distinct primes.at n=47A007304