16166
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 24840
- Proper Divisor Sum (Aliquot Sum)
- 8674
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7888
- Möbius Function
- -1
- Radical
- 16166
- 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
- 146
- 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
- G.f. = continued fraction: A(x) = 1/(1-x-x^2/(1-x^3-x^4/(1-x^5-x^6/(1-x^7-x^8/(...))))).at n=18A088352
- a(n) = the smallest multiple of the n-th prime such that (a(n)-1) is divisible by both the (n-1)th prime and the (n+1)st prime.at n=15A143244
- Numbers k such that there are 14 primes between 100*k and 100*k + 99.at n=35A186406
- Number of polyominoes of site-perimeter n with 8-holes allowed.at n=10A216820
- Number of partitions of n with difference -4 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=43A242688
- Number of length n+4 0..5 arrays with every five consecutive terms having two times the sum of some three elements equal to three times the sum of the remaining two.at n=11A248984
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 805", based on the 5-celled von Neumann neighborhood.at n=23A273604
- Smallest number k > 0 such that sigma(x) and sigma(x)+2 are both prime, where x = (6k+1)^(6n+4), or -1 if no such k exists.at n=8A275237
- Numbers using only digits 1 and 6.at n=41A284293
- Numbers k such that (536*10^k - 23)/9 is prime.at n=17A294635
- a(n) = sum of 2^(k-1) such that floor(n/prime(k)) is odd.at n=44A371906