12166
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 23040
- Proper Divisor Sum (Aliquot Sum)
- 10874
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4680
- Möbius Function
- 1
- Radical
- 12166
- 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
- 156
- 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
- Coefficient of x^4 in expansion of (1+x+x^2)^n.at n=20A005712
- Expansion of (1-x^7)/(1-x)^7.at n=11A008489
- Fibonacci sequence beginning 1, 7.at n=17A022097
- a(n) = n*(31*n + 1)/2.at n=28A022289
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023532, t = (F(2), F(3), F(4), ...).at n=17A025071
- Gaps of 7 in sequence A038593 (upper terms).at n=31A038654
- Denominators of continued fraction convergents to sqrt(380).at n=5A041721
- a(n) = Sum_{d|n, n/d=1 mod 4} d^3 - Sum_{d|n, n/d=3 mod 4} d^3.at n=22A050471
- Jordan function J_3(n).at n=22A059376
- Squarefree n such that the elliptic curve n*y^2 = x^3 - x arising in the "congruent number" problem has rank 3.at n=19A062693
- Triangle T(n,k) (n>=1, rows have irregular lengths) giving number of arrangements of k nonattacking princes on an n X n staggered hexagonal torus board.at n=37A067015
- a(n) = n^3 - 1.at n=22A068601
- a(n) = ceiling(((1*n^0 + 1*n^1 + 2*n^2 + 4*n^3)/(1*n^0 + 2*n^1 + 1*n^2))^2).at n=28A085505
- Expansion of g.f. (7+6*x-6*x^2-3*x^3)/((x^2+x-1)*(x^2-x-1)).at n=16A099255
- Period of the Lucas 4-step sequence A073817 mod n.at n=22A106295
- Period of the Lucas 4-step sequence A073817 mod prime(n).at n=8A106296
- Period of the Lucas 5-step sequence A074048 mod n.at n=22A106297
- Period of the Lucas 5-step sequence A074048 mod prime(n).at n=8A106298
- Period of the Fibonacci 5-step sequence A001591 mod n.at n=22A106303
- Period of the Fibonacci 5-step sequence A001591 mod prime(n).at n=8A106304