16600
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 39060
- Proper Divisor Sum (Aliquot Sum)
- 22460
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6560
- Möbius Function
- 0
- Radical
- 830
- Omega Function (Ω)
- 6
- 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
- 97
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
Appears in sequences
- f-perfect numbers, where f(m) = sigma(m)-m.at n=4A066365
- Convolution of A000203 with partition function (A000041) of positive integers.at n=19A086732
- Keep only the middle digit of each integer and concatenate them. The result is the concatenation of all integers of the sequence.at n=46A106003
- a(n) = (3*n+1)*(5*n+1).at n=33A144459
- The arithmetic mean of the n-th and (n+1)-st cubes, rounded down.at n=25A147656
- Sum of all parts of the partitions of n, minus sigma(n).at n=20A162329
- Numbers m such that m^2 + 3^k is prime for k = 1, 2, 3.at n=25A177173
- Number of representations of n as a sum of products of distinct pairs of positive integers, considered to be equivalent when terms or factors are reordered.at n=42A211856
- Numbers of the form 4^j + 6^k, for j and k >= 0.at n=45A226813
- Number of nX7 0..3 arrays with no element equal to the sum of elements to its left or the sum of elements above it or the sum of the elements diagonally to its northwest or the sum of the elements antidiagonally to its northeast, modulo 4.at n=2A240249
- T(n,k)=Number of nXk 0..3 arrays with no element equal to the sum of elements to its left or the sum of the elements above it or the sum of the elements diagonally to its northwest or the sum of the elements antidiagonally to its northeast, modulo 4.at n=38A240250
- Number of 3Xn 0..3 arrays with no element equal to the sum of elements to its left or the sum of the elements above it or the sum of the elements diagonally to its northwest or the sum of the elements antidiagonally to its northeast, modulo 4.at n=6A240252
- Spironacci-style recurrence: a(0)=0, a(1)=1, a(n) = 2*a(n) XOR a(A265409(n)).at n=15A265407
- Number of parts in all partitions of n in which no part occurs more than eight times.at n=25A320611