16879
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 31
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 16880
- 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
- 16878
- Möbius Function
- -1
- Radical
- 16879
- 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
- 84
- 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
- 1946
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Expansion of (1-x)/(1-x^2-2*x^3).at n=28A078026
- a(n) = A000040(A096480(n)).at n=34A096481
- Primes with digit sum = 31.at n=19A106767
- Prime Friedman numbers.at n=14A112419
- Numbers k such that the difference between k-th prime and next prime is 70.at n=2A116493
- Difference between first twin prime > 10^n and 10^n.at n=36A124001
- Smallest number that can be written in exactly n ways as a sum of distinct repdigits of its decimal digits.at n=37A131367
- Primes of the form 2*3*5*7*n+79.at n=38A141563
- Primes congruent to 25 mod 53.at n=40A142555
- Primes congruent to 5 mod 59.at n=36A142732
- Primes congruent to 43 mod 61.at n=28A142841
- Primes p such that p, p+4, p+10, p+22, p+24, p+42 are all primes.at n=9A144594
- The smaller member prime(i) of an emirp pair (prime(i),prime(j)), such that the digit sum of i equals the digit sum of j.at n=16A178613
- Numbers k such that 2^(k-1) == 1 + b*k (mod k^2), where b divides k - 2^p for some integer p >= 0 and 2^p <= b.at n=32A186884
- Primes of the form 5n^3+4.at n=2A201174
- Primes of the form 3n^2 + 4.at n=16A201477
- The least number s having exactly n fours in the continued fraction of sqrt(s).at n=24A206584
- Triangular array of numbers of 2-polymatroids of rank k on n labeled points, for n>=0, 0<=k<=2n.at n=51A256158
- Triangular array of numbers of 2-polymatroids of rank k on n labeled points, for n>=0, 0<=k<=2n.at n=61A256158
- Value of prime number D for incrementally largest values of minimal x satisfying the equation x^2 - D*y^2 = 2.at n=34A336786