16073
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 16074
- 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
- 16072
- Möbius Function
- -1
- Radical
- 16073
- 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
- 190
- 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
- 1871
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 67.at n=18A020406
- a(n) = T(n, n-1), T given by A026519. Also a(n) = number of integer strings s(0), ..., s(n), counted by T, such that s(n) = 1.at n=12A026521
- a(n) = T(n,n-1), T given by A026552. Also a(n) is the number of integer strings s(0),...,s(n) counted by T, such that s(n)=1.at n=12A026554
- Primes arising in A053782.at n=24A053872
- Prime number spiral (clockwise, North spoke).at n=22A054551
- Primes p such that x^49 = 2 has no solution mod p, but x^7 = 2 has a solution mod p.at n=5A059667
- Primes for which the four closest primes are smaller.at n=35A075030
- a(n) = r-th prime of the form (p-q)/(q-r) with r=prime(n+1), q=prime(n+2), and primes p > q.at n=58A089577
- Partial sums of A000960.at n=38A099074
- Primes congruent to 46 mod 47.at n=37A142397
- Primes congruent to 14 mod 53.at n=33A142544
- Primes congruent to 25 mod 59.at n=32A142752
- Primes congruent to 30 mod 61.at n=28A142828
- Primes p such that both pi(p) and the concatenation of pi(p) and p are prime, where pi is the prime counting function.at n=25A155032
- Honaker emirps: terms in A033548 that are emirps.at n=24A161118
- Number of binary strings of length n with equal numbers of 0011 and 0101 substrings.at n=16A164174
- Cyclops emirps.at n=19A183057
- Prime numbers > 10000 such that all the substrings of length >= 4 are primes (substrings with leading '0' are considered to be nonprime).at n=17A211686
- Smallest prime k such that k*2^n-1 , k*2^n-1+2*j , k*2^n-1+4*j or k*2^n-1-2*j , k*2^n-1 , k*2^n-1+2*j are consecutive primes in arithmetic progression for some j.at n=31A228452
- Primes p of the form 14*k+1 for which there is a solution to x^7 == 2 mod p.at n=41A270802