16067
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 16068
- 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
- 16066
- Möbius Function
- -1
- Radical
- 16067
- 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
- 97
- 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
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1869
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numerators of Cotesian numbers (not in lowest terms): A002176(n)*C(n,0).at n=9A002177
- Median term of prime 5-tuples (p, p+2, p+6, p+8, p+12).at n=4A090286
- Primes p such that 2^j+p^j are primes for j=0,1,2,4.at n=9A094487
- Primes p such that 2^j+p^j are primes for j=0,1,2,8.at n=3A094488
- Primes p such that 2^j+p^j are primes for j=0,2,4,8.at n=1A094494
- Solutions to A096509[x]=6; number of prime-powers [including primes] in the neighborhood of x with Ceiling[Log[x]] radius equals 6.at n=13A096517
- Primes of the form (prime(prime(k)) + prime(prime(k+1)))/2.at n=16A098042
- Primes occurring in exactly three prime triples (p,q,r) with p<q<r=p+6.at n=11A098423
- Numerator of Cotesian number C(n,0).at n=10A100620
- Triangle read by rows: numerators of Cotesian numbers C(n,k) (0 <= k <= n).at n=55A100640
- Primes p such that p + 2 and p^2 + 2^2 are primes.at n=29A107312
- Least p=prime(k) for which A118123(k)=n.at n=31A117877
- Prime quadruples: 3rd term.at n=15A136721
- Primes congruent to 40 mod 47.at n=38A142391
- Primes congruent to 8 mod 53.at n=38A142538
- Primes congruent to 19 mod 59.at n=32A142746
- Primes congruent to 24 mod 61.at n=30A142822
- Primes expressed as the sum of square of digits of all primes.at n=23A181508
- Primes p with p + 2 and prime(p) - 2 both prime.at n=29A236467
- Irregular triangle read by rows: T(n,k) is the number of identity trees with n nodes and maximal branching factor k.at n=65A244523