15976
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 29970
- Proper Divisor Sum (Aliquot Sum)
- 13994
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7984
- Möbius Function
- 0
- Radical
- 3994
- Omega Function (Ω)
- 4
- 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
- yes
- 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
- Number of paraffins C_n H_{2n} X_2 with n carbon atoms.at n=11A000636
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 63.at n=27A031561
- Illustration of Viswanath's constant A078416.at n=11A083404
- Numbers n such that reverse(sigma(n)) = n - phi(n) = cototient(n).at n=6A098215
- Total number of n-digit numbers requiring 2 positive cubes in their representation as a sum of cubes.at n=6A181376
- G.f.: 1/((1-t^10)*(1-t)*(1-t^3)*(1-t^5)*(1-t^7)*(1-t^9)*(1-t^11)*(1-t^13)*(1-t^15)*(1-t^17)*(1-t^19)).at n=64A266750
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 326", based on the 5-celled von Neumann neighborhood.at n=42A271261
- a(n) = (Sum_{j=1..h-1} a(n-j) + a(n-1)*a(n-h+1))/a(n-h) with a(1), ..., a(h)=1, where h = 6.at n=13A283960
- Expansion of Product_{k>=1} ((1 + x^k)/(1 - x^k))^(k*(k-1)/2).at n=13A294780
- Number of nX3 0..1 arrays with every element equal to 0, 1, 3, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=7A300316
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 3, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=47A300321
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 3, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=52A300321
- Coefficients of the expansion of Sum_{i,j,k>=1} x^(i*j*k)/((1-x^i)*(1-x^j)*(1-x^k)).at n=44A350596
- G.f. A(x) satisfies: Product_{n>=1} (1 + x^n*A(x)) = Product_{n>=1} (1 + x^n/(1-x)^n).at n=14A352120
- Triangle read by rows where T(n,k) is the number of set partitions of {1..n} with exactly k distinct block-sums.at n=58A371788
- Expansion of 1/sqrt((1 - x^4 - x^5)^2 - 4*x^9).at n=41A376722