16871
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 16872
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16870
- Möbius Function
- -1
- Radical
- 16871
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 58
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1945
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes that remain prime through 3 iterations of function f(x) = 4x + 9.at n=41A023282
- Palindromic primes in base 3.at n=24A029971
- Numbers whose base-5 representation contains exactly three 1's and three 4's.at n=23A045262
- a(n) = Sum_{k=0..n} C(n,k)*|Stirling1(n,k)*Stirling2(n,k)|.at n=5A047794
- Primes with 17 as smallest positive primitive root.at n=17A061329
- Primes which are the sum of three 5th powers.at n=4A085319
- Table(n,j) of primes p = k*prime(n)#/210-j, where k is the least integer such that p and p+8 are consecutive primes, for n > 4 and j=7 to 1.at n=11A098078
- Primes of the form a^5 + b^3 with a,b>0.at n=22A100273
- Primes by index in A001945.at n=53A104499
- a(n) = A007290(n+2) - 1 = 2*C(n+2,3) - 1.at n=36A108766
- Numbers n such that p(8n) is prime, where p(n) is the number of partitions of n.at n=26A114168
- Duplicate of A085319.at n=4A123032
- Primes p that divide Fibonacci[(p-1)/7].at n=23A125253
- Primes in A132286.at n=41A132287
- Primes for which the period of the reciprocal equals (p-1)/14.at n=15A135073
- Triangle T(n,m) read by rows: T(m,n) = (1+n*3^m)-th prime.at n=41A137440
- Primes congruent to 17 mod 53.at n=40A142547
- Primes congruent to 56 mod 59.at n=36A142783
- Primes congruent to 35 mod 61.at n=33A142833
- Primes of the form 6*n^2+17.at n=37A151953