12210
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 32832
- Proper Divisor Sum (Aliquot Sum)
- 20622
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2880
- Möbius Function
- -1
- Radical
- 12210
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 5
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
- yes
Recreational
- Happy Number
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 112
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- An upper bound on the biplanar crossing number of the complete graph on n nodes.at n=43A007333
- Products of exactly 5 distinct primes.at n=32A046387
- Successive positions in Tower of Hanoi (with three pegs {0,1,2}) where xyz means smallest disk is on peg z, second smallest is on peg y, third smallest on peg x, etc. and leading zeros indicate largest disks are all on peg 0.at n=18A055662
- n written efficiently in natural numbers base, i.e., in form ...wxyz where n =1*z + 2*y + 3*x + 4*w + ... with z < 1, y < 2, x < 3, w < 4, ...at n=19A055992
- Trajectory of 29 under the `29x+1' map.at n=3A057687
- Maximal term in trajectory of P under the 'Px+1' map, where P = n-th prime, or -1 if no such term exists.at n=8A057689
- The n-th n-gonal number: a(n) = n*(n^2 - 3*n + 4)/2.at n=30A060354
- A064637 converted to factorial base.at n=14A064477
- Largest possible z-value of an integer solution (x,y,z) to 4/n = 1/x + 1/y + 1/z satisfying 0 < x < y < z. The x and y components are in A075245 and A075246.at n=37A075247
- Largest x such that 1/x + 1/y + 1/z = 1/n.at n=9A082986
- Convolution of sigma(n) with phi(n).at n=39A086733
- Lcm[{ad(n)}], i.e. the least common multiple of the anti-divisors of n.at n=52A096357
- Squarefree oblong (pronic) numbers having an odd number of prime factors.at n=17A098827
- a(n) = n*(n+7)*(n+8)/6.at n=37A111396
- {2n}_{2n}.at n=54A122642
- Numbers n such that n is divisible by (3*s(n)*s(n)+2), where s(n) = sum of digits of n.at n=46A134556
- Sequence representing valid nontrivial 1-dimensional Hashi (a.k.a. Bridges or Hashiwokakero) puzzle orientations.at n=25A143964
- a(n) = largest value of the function rad(m*n*(n - m)) n=2,3,4,..., 0 < m < n where the function rad(k) (also called radical(k)) is the product of distinct prime divisors of k.at n=35A147299
- Alexandrian integers: numbers of the form n = p*q*r such that 1/n = 1/p - 1/q - 1/r for some integers p,q,r.at n=19A147811
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (0, -1, 1), (0, 0, 1), (1, 1, -1), (1, 1, 0)}.at n=7A150662