12480
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
- 56
- Divisor Sum
- 42672
- Proper Divisor Sum (Aliquot Sum)
- 30192
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3072
- Möbius Function
- 0
- Radical
- 390
- Omega Function (Ω)
- 9
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 125
- 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 ways of writing n as a sum of 6 squares.at n=28A000141
- Number of n-step self-avoiding walks on f.c.c. lattice ending at point with x = 3.at n=2A000768
- Values of phi(k) when phi(k) = phi(k+1).at n=22A003275
- Number of nonseparable tree-rooted planar maps with n + 3 edges and 4 vertices.at n=4A006412
- Theta series of D_6 lattice.at n=14A008428
- a(n) = floor( n*(n-1)*(n-2)/22 ).at n=66A011904
- Pisot sequence P(4,11), a(0)=4, a(1)=11, a(n+1) is the nearest integer to a(n)^2/a(n-1). Evidently satisfies a(n) = 2*a(n-1)+2*a(n-2).at n=8A021006
- 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 55.at n=31A031553
- Numbers k such that A102489(k) is divisible by k.at n=38A032563
- Numbers k whose decimal representation, read as a base-24 value and divided by k, yields an integer.at n=16A032579
- a(n) = n^6*(n^6 + 1)*(n^2 - 1).at n=2A033669
- Total number of possible knight moves on an (n+2) X (n+2) chessboard, if the knight is placed anywhere.at n=39A035008
- a(n) = n^3*(n^3 + 1)*(n-1).at n=4A037251
- Triangle of coefficients of polynomials (rising powers) useful for convolutions of A001333(n+1), n >= 0 (associated Pell numbers).at n=10A062134
- a(n) = n*(n-1)*(n-3)*(n-5).at n=13A062765
- Sum of all partitions of n into distinct parts.at n=32A066189
- Numbers m such that m*tau(m)>5*prime(m).at n=30A068547
- Numbers occurring twice in A068627.at n=16A068628
- Least number m such that cardinality of InvPhi(m) = prime(n).at n=28A071389
- T(n,k) = right- or upward-moving paths connecting opposite corners of an n X n chessboard, visiting the diagonal at k points between start and finish.at n=33A075435