12066
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
- 8
- Divisor Sum
- 24144
- Proper Divisor Sum (Aliquot Sum)
- 12078
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4020
- Möbius Function
- -1
- Radical
- 12066
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 42
- 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
- Number of n-node graphs with no cycles of length less than 5.at n=11A006787
- Numbers k such that sum of factorials of digits of k equals pi(k) (A000720).at n=5A049529
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049747.at n=33A049748
- a(n) gives smallest number requiring n iterations of the map i -> A053392(i) to reach zero.at n=29A060630
- a(n) is the area of the triangle with sides prime(n), prime(n+2) and prime(n+4), rounded down to the nearest integer.at n=33A096384
- Lesser of twin admirable numbers: k such that k and k+2 are both admirable numbers.at n=40A109730
- Start with 1 and repeatedly reverse the digits and add 65 to get the next term.at n=25A118163
- Number of ways to place 4 nonattacking bishops on a 4 X n board.at n=7A172208
- Triangle of coefficients of polynomials u(n,x) jointly generated with A209831; see the Formula section.at n=50A209830
- Number of length n+3 0..2 arrays with no four consecutive terms having the maximum of any two terms equal to the minimum of the remaining two terms.at n=9A250381
- Number of nX5 0..1 arrays with every element unequal to 0, 1, 2 or 5 king-move adjacent elements, with upper left element zero.at n=7A303958
- a(n) = 2*n*Fibonacci(n-2) + (-1)^n + 1.at n=14A309874
- Number of cyclic subgroups of the group SL(2, Z(n)), counting conjugates as distinct.at n=41A316537
- a(n) is the number of edges formed by n-secting the angles of a hexagon.at n=26A335735
- Expansion of g.f. A(x) satisfying A(x) = (1 + 3*x*A(x)) * (1 + x*A(x)^2).at n=5A375435