16007
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
- 2
- Divisor Sum
- 16008
- 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
- 16006
- Möbius Function
- -1
- Radical
- 16007
- 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
- yes
- 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
- 1864
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes of the form k^2 + k + 5.at n=34A027755
- 3 consecutive primes differ by 2n or more starting at a(n).at n=10A054697
- 3 consecutive primes differ by 2n or more starting at a(n).at n=11A054697
- First term of strong prime quintets: p(m+1)-p(m) > p(m+2)-p(m+1) > p(m+3)-p(m+2) > p(m+4)-p(m+3).at n=36A054808
- Primes p such that x^53 = 2 has no solution mod p.at n=33A059258
- Irregular primes with irregularity index three.at n=26A060975
- a(n) = 10*n^2 + 7.at n=40A061722
- First prime after phi(prime(n)^2).at n=30A079477
- Primes that represent some mean of 4 consecutive (2 smaller, itself, 1 larger) primes.at n=38A094932
- a(n) = 2^n - Fibonacci(n).at n=14A099036
- Primes in A103377.at n=15A103387
- a(n) = prime((a(n-1)+1)/2), a(1) = 9.at n=11A104296
- prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 7.at n=32A109561
- a(n+1) = gpf(2*prime(a(n-1)) + prime(a(n))) where gpf = greatest prime factor, with a(0)=1, a(1)=2.at n=34A122631
- Primes p such that q-p = 26, where q is the next prime after p.at n=7A124594
- Triangle read by rows counting compositions (ordered partitions) by minimal part size.at n=119A125104
- Prime numbers k such that k^2 +- (k+1) are primes.at n=40A137460
- Primes congruent to 18 mod 59.at n=37A142745
- Primes congruent to 25 mod 61.at n=35A142823
- Primes in A152535.at n=22A152563