12960
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 60
- Divisor Sum
- 45738
- Proper Divisor Sum (Aliquot Sum)
- 32778
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3456
- Möbius Function
- 0
- Radical
- 30
- Omega Function (Ω)
- 10
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 32
- 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
- yes
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Theta series of D_5 lattice.at n=41A005930
- Numbers found in denominators of expansion of Airy function Ai(x).at n=6A014402
- Numbers found in denominators of expansion of Airy function Bi(x).at n=6A014403
- Number of divisors of A019505(n).at n=51A020697
- Numbers of form 6^i*10^j with i, j >= 0.at n=16A025629
- Theta series of 6-dimensional lattice P6.4 = A6,2.at n=38A029690
- Number of dyslexic rooted planar trees with n nodes where any 2 subtrees extending from a node are of different sizes.at n=14A032048
- Number of reversible strings with n labeled beads of 3 colors, no palindromes of more than 1 bead.at n=4A032070
- a(n) = 10*n^2.at n=36A033583
- a(n) = 4*n*(2*n + 1).at n=40A033586
- Highly factorable numbers: numbers with a record number of proper factorizations.at n=34A033833
- For all n, if d is recursively applied to a(n) exactly 6 times then the fixed point of d-iteration is just reached.at n=11A036458
- Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j)*6^j.at n=19A038212
- Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*2^j.at n=16A038256
- Numbers having four 0's in base 6.at n=28A043372
- Numbers that are divisible by exactly 10 primes with multiplicity.at n=27A046314
- Expansion of e.g.f. (1-2*x)/(1-3*x-x^2+2*x^3).at n=5A052669
- a(n) = 3*n*n!.at n=6A052673
- Numbers k such that Sum_{j} p_j = Sum_{j} e_j where Product_{j} p_j^(e_j) is the prime factorization of k.at n=20A054411
- Number of primitive (period n) periodic palindromes using a maximum of three different symbols.at n=15A056494