12072
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 30240
- Proper Divisor Sum (Aliquot Sum)
- 18168
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4016
- Möbius Function
- 0
- Radical
- 3018
- Omega Function (Ω)
- 5
- 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
- 68
- 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 discordant permutations of length n.at n=8A000183
- Permanent of a certain cyclic n X n (0,1) matrix.at n=9A000805
- Expansion of theta_3 / theta_4.at n=18A007096
- Triangle read by rows: T(n,k) = number of permutations of [n] allowing i->i+j (mod n), j=0..k-1.at n=41A008305
- Coordination sequence for net formed by holes in D_4 lattice.at n=10A010079
- Expansion of (theta_3(q) / theta_4(q))^2 in powers of q.at n=9A014969
- a(n) = Sum_{k=0..n-3} T(n,k) * T(n,k+3), with T given by A026769.at n=5A027242
- a(0)=2; a(n) is the smallest k > a(n-1) such that the fractional part of k^(1/11) starts with n.at n=35A034076
- Let (u1,u2) be successive untouchable numbers such that phi(u1) = phi(u2) = k; sequence gives values of k.at n=42A048191
- McKay-Thompson series of class 32A for Monster.at n=37A058629
- a(n) = |{m : multiplicative order of 8 mod m = n}|.at n=49A059890
- a(n) = |{m : multiplicative order of 8 mod m = n}|.at n=53A059890
- Numbers k such that sigma(k) divides sigma(sigma(k)).at n=36A066961
- Multiples of 3018.at n=3A086746
- Numbers n for which there are exactly six k such that n = k + (product of nonzero digits of k).at n=8A096927
- Expansion of phi(x) / f(-x^4)^2 in powers of x where phi(), f() are Ramanujan theta functions.at n=61A137828
- a(n) = 1728*n - 24.at n=6A157287
- Averages of twin prime pairs which can be represented as a sum of three consecutive of such pair averages.at n=16A160917
- Expansion of theta_4/theta_3 in powers of q.at n=18A189925
- Number of 0..n arrays x(0..8) of 9 elements with zero 4th differences.at n=46A200445