16008
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 43200
- Proper Divisor Sum (Aliquot Sum)
- 27192
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4928
- Möbius Function
- 0
- Radical
- 4002
- 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
- 53
- 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
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (primes).at n=28A024604
- a(n) = T(n,1) + T(n-1,2) + ...+ T(n-k+1,k), where k = floor((n+1)/2) and T is the array defined in A026098.at n=42A026103
- a(n) can be expressed as the difference of the squares of consecutive primes in just three distinct ways.at n=3A090783
- Numbers that can be expressed as the difference of the squares of primes in exactly six distinct ways.at n=14A092002
- Number of subsets of {1,2,...,n} such that every number in the set is no larger than the sum of the other numbers in the set.at n=13A095941
- Number of (1,1)-steps in all Delannoy paths of length n.at n=6A108666
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2 + (x + 23)^2 = y^2.at n=12A118337
- Triangle read by rows: row n (n>=0) has g.f. Sum_{i=1..n} n!*x^i*(1+x)^(n-i)/(n+1-i).at n=31A126671
- Third column of A126671.at n=5A126672
- Triangle read by rows: T(n,k) is the number of paths in the right half-plane from (0,0) to (n,0), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0), having k h=(1,0) steps (0<=k<=n).at n=67A132884
- Number of 6X6 arrays of squares of integers, symmetric about both diagonal and antidiagonal, with all rows summing to n.at n=36A156389
- Number of n X n arrays of squares of integers, symmetric about both diagonal and antidiagonal, with all rows summing to 36.at n=5A156498
- Record gaps between nonprime prime powers.at n=26A167186
- a(n) = 6*a(n-1)-8*a(n-2) for n > 3; a(0)=279, a(1)=3996, a(2)=16008, a(3)=64784.at n=2A177844
- Distance from Fibonacci(n) to the next perfect square.at n=47A216223
- Numbers m such that if x = sigma(m)-phi(m)-tau(m)-m then m = sigma(x)-phi(x)-tau(x)-x.at n=2A238230
- Smallest distance of the n-th Fibonacci number to the set of all square integers.at n=47A243256
- Number of nX4 0..1 arrays with every element unequal to 0, 1, 3, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=6A317693
- Number of nX7 0..1 arrays with every element unequal to 0, 1, 3, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=3A317696
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 3, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=48A317697