626
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- yes
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 942
- Proper Divisor Sum (Aliquot Sum)
- 316
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- yes
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 312
- Möbius Function
- 1
- Radical
- 626
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 131
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- sechshundertsechsundzwanzig· ordinal: sechshundertsechsundzwanzigste
- English
- six hundred twenty-six· ordinal: six hundred twenty-sixth
- Spanish
- seiscientos veintiséis· ordinal: 626º
- French
- six cent vingt-six· ordinal: six cent vingt-sixième
- Italian
- seicentoventisei· ordinal: 626º
- Latin
- sescenti viginti sex· ordinal: 626.
- Portuguese
- seiscentos e vinte e seis· ordinal: 626º
Appears in sequences
- -1 + number of partitions of n.at n=20A000065
- Conjecturally largest even integer which is an unordered sum of two primes in exactly n ways.at n=12A000954
- a(n) = least m such that if a/b < c/d where a,b,c,d are integers in [0,n], then a/b < k/m < c/d for some integer k.at n=29A001000
- sigma_4(n): sum of 4th powers of divisors of n.at n=4A001159
- Numbers k such that phi(k) = phi(k+2).at n=16A001494
- a(n) = n^2 + 1.at n=25A002522
- a(n) = n^4 + 1.at n=5A002523
- Numbers that are the sum of 2 positive 4th powers.at n=10A003336
- Numbers that are the sum of 6 positive 4th powers.at n=46A003340
- G.f.: 1/((1-x)*(1-x^2)*(1-x^3)^2*(1-x^4)*(1-x^5)).at n=22A003402
- Möbius transform of A003964.at n=66A003978
- Sums of distinct nonzero 4th powers.at n=16A003999
- Convolution of A002024 with itself.at n=27A004797
- Numbers that are the sum of at most 2 nonzero 4th powers.at n=16A004831
- Numbers that are the sum of at most 3 nonzero 4th powers.at n=35A004832
- Numbers that are the sum of at most 4 nonzero 4th powers.at n=64A004833
- Untouchable numbers, also called nonaliquot numbers: impossible values for the sum of aliquot parts function (A001065).at n=50A005114
- Number of n-term 2-sided generalized Fibonacci sequences.at n=6A005189
- T(n+2,2) from table A045912 of characteristic polynomial of negative Pascal matrix.at n=3A006135
- T(n+3,3) from table A045912 of characteristic polynomial of negative Pascal matrix.at n=2A006136