16100
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 41664
- Proper Divisor Sum (Aliquot Sum)
- 25564
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5280
- Möbius Function
- 0
- Radical
- 1610
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- 71
- 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
- Expansion of 1/(1-4*x)^(21/2).at n=3A020932
- a(n) = (2*n - 1)*(3*n^2 - 3*n + 2)/2.at n=17A063491
- Numbers k such that phi((prime(k)-1)/2) = sigma(k).at n=37A068474
- Triangle read by rows: T(n, m) = number of painted forests on labeled vertex set [n] with m trees. Also number of painted forests with exactly n - m edges.at n=32A106834
- Negative numbers written in a bits-of-Pi/primorial base system.at n=23A109839
- n^3+Smallest square, (Smallest square >= n^3).at n=20A176581
- Number of n X 3 binary matrices with no three 1's adjacent in a line diagonally or antidiagonally.at n=4A181214
- Number of nX5 binary matrices with no three 1's adjacent in a line diagonally or antidiagonally.at n=2A181216
- T(n,k)=Number of nXk binary matrices with no three 1's adjacent in a line diagonally or antidiagonally.at n=23A181217
- T(n,k)=Number of nXk binary matrices with no three 1's adjacent in a line diagonally or antidiagonally.at n=25A181217
- Number of nX5 binary arrays without the pattern 0 1 0 diagonally or antidiagonally.at n=2A188906
- T(n,k)=Number of nXk binary arrays without the pattern 0 1 0 diagonally or antidiagonally.at n=23A188910
- T(n,k)=Number of nXk binary arrays without the pattern 0 1 0 diagonally or antidiagonally.at n=25A188910
- Number of nX5 binary arrays without the pattern 1 1 0 diagonally or antidiagonally.at n=2A189107
- T(n,k)=Number of nXk binary arrays without the pattern 1 1 0 diagonally or antidiagonally.at n=23A189111
- Expansion of 5*(1-6*x+x^2)/(1-10*x+5*x^2).at n=4A189317
- Number of (weakly) superprimitive binary sequences of length n.at n=14A216215
- a(n) = n*(n+1)*(11*n +10)/6.at n=20A254407
- 29-gonal numbers: a(n) = n*(27*n-25)/2.at n=35A255187
- Numbers k such that (266*10^k + 1)/3 is prime.at n=31A269303