10166
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 18144
- Proper Divisor Sum (Aliquot Sum)
- 7978
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4224
- Möbius Function
- 1
- Radical
- 10166
- 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
- 86
- 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
- a(0) = 1, a(n) = 21*n^2 + 2 for n>0.at n=22A010011
- Sum of distinct prime factors of floor(Pi*10^n), Pi=3.14....at n=7A089286
- Sum of all prime factors of floor(Pi*10^n), Pi=3.14....at n=7A089287
- Positive integers n such that n^14 + 1 is semiprime (A001358).at n=42A104335
- a(4n+1)=2a(4n), a(4n+2)=2a(4n+1), a(4n+3)=2a(4n+2), a(4n+4)=2a(4n+3)+A007583(n).at n=17A139784
- First differences of A139784.at n=17A139785
- Twice 11-gonal numbers: a(n) = n*(9*n-7).at n=34A152995
- 13 times pentagonal numbers: a(n) = 13*n*(3*n-1)/2.at n=23A153793
- Multiples of 23 whose digit reversal + 1 is also a multiple of 23.at n=15A166393
- Triangle T, read by rows, where T(n,k) = [T^n](n-k-1,0); i.e., where row n of T equals the initial n terms of column 0 in matrix power T^n, reversed and with an appended '1', for n>0, with T(0,0)=1.at n=21A167015
- Column 0 of triangle T=A167015: a(n) = T(n,0) = [T^n](n-1,0) for n>0 with a(0)=1.at n=6A167016
- Numbers whose square can be written as sum of at least 3 consecutive triangular numbers in two ways.at n=6A256000
- Convolution of A006068 (inverse of Gray code) with itself: a(n) = Sum_{k=1..n+1} A006068(k) * A006068(1+n-k).at n=35A268721
- Even numbers k such that A103230(k) is a perfect square.at n=25A332531
- a(0) = 1, and for n > 0, a(n) = A019565(Sum_{i=0..n-1} a(i)), where A019565 is the base-2 exp-function.at n=5A376406