15468
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 36120
- Proper Divisor Sum (Aliquot Sum)
- 20652
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5152
- Möbius Function
- 0
- Radical
- 7734
- Omega Function (Ω)
- 4
- 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
- 84
- 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 partitions of n with equal number of parts congruent to each of 1 and 3 (mod 5).at n=49A035557
- T(n,n-3), array T as in A054110.at n=33A054112
- Symmetrical triangle sequence from polynomials: q(x,n)=-((-1)^n*(Sum[(k + 1)^n*x^k/k^2, {k, 1, Infinity}] - PolyLog[2, x])*(x - 1)^(n - 1) + (-1)^n*n *(-1 + x)^(n - 1) Log[1 - x])/x; p(x,n)=q(x,n)+x^n*q(1/x,n).at n=40A154991
- a(n) = n*(2*n^2 + 5*n + 17)/2.at n=24A163661
- Number of strings of numbers x(i=1..6) in 0..n with sum i^3*x(i)^2 equal to 216*n^2.at n=37A184307
- Irregular triangle T(n,k) read by rows: The number of tilings of the n X n board by 1 X 1 and k 3 X 3 squares, n >= 0, k >= 0.at n=37A276171
- Number T(n,k) of n-step walks on cubic lattice starting at (0,0,0), ending at (x,y,z) with x=k, remaining in the first (nonnegative) octant and using steps (0,0,1), (0,1,0), (1,0,0), (-1,1,1), (1,-1,1), and (1,1,-1); triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=52A328297
- Number of edges in a square when n internal squares are drawn between the 4n points that divide each side into n+1 equal parts.at n=44A357061