16057
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 16058
- 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
- 16056
- Möbius Function
- -1
- Radical
- 16057
- 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
- 53
- 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
- 1866
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(0) = 587, a(n) = 3*a(n-1) + 16 for n > 0 (the first 11 terms are primes).at n=3A003539
- Incorrect duplicate of A297408.at n=7A007355
- E.g.f.: exp(x + sinh(x)).at n=9A009283
- Initial members of prime 5-tuples (p, p+4, p+6, p+10, p+12).at n=6A022007
- Initial member of prime sextuples (p, p+4, p+6, p+10, p+12, p+16).at n=2A022008
- Primes that remain prime through 3 iterations of function f(x) = 2x + 3.at n=27A023273
- Primes that remain prime through 4 iterations of function f(x) = 2x + 3.at n=11A023303
- Primes that remain prime through 5 iterations of function f(x) = 2x + 3.at n=5A023331
- [ (4th elementary symmetric function of S(n))/(2nd elementary symmetric function of S(n)) ], where S(n) = {first n+3 positive integers congruent to 1 mod 3}.at n=15A024223
- a(n) = Sum_{k=0..n-2} T(n,k) * T(n,k+2), with T given by A026626.at n=6A026963
- Primes followed by a [4,2,4] prime difference pattern of A001223.at n=29A052378
- Third term of strong prime 5-tuples: p(m-1)-p(m-2) > p(m)-p(m-1) > p(m+1)-p(m) > p(m+2)-p(m+1).at n=36A054810
- Primes p whose period of reciprocal equals (p-1)/9.at n=10A056214
- Primes p such that x^18 = 2 has no solution mod p, but x^6 = 2 has a solution mod p.at n=30A059664
- Primes p such that x^54 = 2 has no solution mod p, but x^6 = 2 has a solution mod p.at n=32A059665
- Integers n > 10553 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 10553.at n=9A063061
- Primes p = prime(k) such that prime(k) + prime(k+5) = prime(k+1) + prime(k+4) = prime(k+2) + prime(k+3).at n=42A064101
- Primes p such that three (the maximum number) primes occur between p and p+12.at n=10A086140
- Prime(p)-4 for primes p such that prime(p) - 4 is prime.at n=39A094069
- Prime numbers which when written in base 7 have a composite digit-sum.at n=25A096790