16006
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
- 8
- Divisor Sum
- 24624
- Proper Divisor Sum (Aliquot Sum)
- 8618
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7800
- Möbius Function
- -1
- Radical
- 16006
- 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
- 45
- Smith Number
- no
- Vampire 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
Appears in sequences
- Number of ways in which n identical balls can be distributed among 6 boxes in a row such that each pair of adjacent boxes contains at least 4 balls.at n=9A005339
- Numbers whose base-7 representation contains exactly four 4's.at n=29A043412
- Binomial transform of 1,0,1,0,1,1,1,...at n=14A084635
- a(n) = a(n-1) - 2*a(n-2) - 3*a(n-3) - ... - (n-1)*a(1), with a(1) = a(2) = 2, a(3) = -2.at n=14A106541
- Floor of the area of consecutive Prime-Indexed Prime triangles.at n=9A119659
- Expansion of g.f. x^2/(1-2*x-49*x^2).at n=6A123005
- Triangle T(n, k) = binomial(2*n, n) + binomial(n, k)^2, read by rows.at n=39A157531
- Triangle T(n, k) = binomial(2*n, n) + binomial(n, k)^2, read by rows.at n=41A157531
- a(n) = 2^n - Fibonacci(n) - 1.at n=14A228078
- Incorrect version of A045949.at n=17A229620
- Number of length n+2 0..5 arrays with every three consecutive terms having the sum of some two elements equal to twice the third.at n=11A248430
- Number of (n+1)X(n+1) 0..1 arrays with no 2X2 subblock having the maximum of its diagonal elements greater than the absolute difference of its antidiagonal elements.at n=3A251309
- Number of (n+1)X(4+1) 0..1 arrays with no 2X2 subblock having the maximum of its diagonal elements greater than the absolute difference of its antidiagonal elements.at n=3A251313
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with no 2X2 subblock having the maximum of its diagonal elements greater than the absolute difference of its antidiagonal elements.at n=24A251317
- Submain diagonal of array A265903: a(n) = A265903(n+1, n).at n=8A265909
- Numbers m such that there exists a j for which m = Sum_{k=1..j} (m mod k), where k runs through the largest j primes less than m.at n=33A274422
- Number of nX6 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2, 3 or 5 neighboring 1s.at n=3A297800
- T(n,k) = Number of n X k 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2, 3 or 5 neighboring 1's.at n=39A297802
- Number of 4Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2, 3 or 5 neighboring 1s.at n=5A297804
- Partial sums of A299900.at n=31A299901