12270
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
- 29520
- Proper Divisor Sum (Aliquot Sum)
- 17250
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3264
- Möbius Function
- 1
- Radical
- 12270
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 63
- 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
- High-temperature series in v = tanh(J/kT) for susceptibility for the Ising model on honeycomb structure.at n=14A002910
- High-temperature series for susceptibility for the spin-1/2 Ising model on hexagonal lattice.at n=7A002919
- Numbers whose base-4 representation contains exactly three 2's and four 3's.at n=13A045152
- Squarefree n such that the elliptic curve n*y^2 = x^3 - x arising in the "congruent number" problem has rank 3.at n=20A062693
- a(1) = 2; a(n+1) = a(n) + p, where p is the largest prime <= a(n).at n=13A123196
- a(n) = prime(n)^2 - prime(n^2). Commutator of (primes, squares) at n.at n=34A123914
- Records in A064844.at n=20A135987
- a(n) = n*(14*n - 11).at n=30A195021
- a(n) = (n-2)*(14*n-39) for n > 2, otherwise a(n) = n.at n=32A195030
- Number of n X n arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor, without move-in move-out left turns.at n=3A221603
- Number of n X 4 arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor, without move-in move-out left turns.at n=3A221605
- T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor, without move-in move-out left turns.at n=24A221609
- Number of 4Xn arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor, without move-in move-out left turns.at n=3A221612
- Number of permutations of [n] having exactly 10 strong fixed blocks.at n=3A225971
- Numbers n for which n' + n and n' - n are both prime, n' being the arithmetic derivative of n.at n=32A229272
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 262", based on the 5-celled von Neumann neighborhood.at n=43A271067
- Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 473", based on the 5-celled von Neumann neighborhood.at n=17A282450
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 629", based on the 5-celled von Neumann neighborhood.at n=13A283389
- Number of (not necessarily connected) simple cyclic graphs on n vertices.at n=7A286743
- a(n) = 24*2^n - 18.at n=9A305163