16111
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 16112
- 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
- 16110
- Möbius Function
- -1
- Radical
- 16111
- 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
- 146
- 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
- 1876
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes that contain digits 1 and 6 only.at n=5A020454
- a(n) = T(n, n+4), T given by A027052.at n=10A027055
- a(n) = A027052(n, 2n-10).at n=9A027066
- "DGK" (bracelet, element, unlabeled) transform of 1,2,3,4,...at n=16A032233
- Primes p whose reciprocal has period (p-1)/10.at n=25A056215
- Primes p such that x^18 = 2 has no solution mod p, but x^6 = 2 has a solution mod p.at n=31A059664
- Primes p such that x^54 = 2 has no solution mod p, but x^6 = 2 has a solution mod p.at n=33A059665
- Primes p such that x^36 = 2 has no solution mod p, but x^12 = 2 has a solution mod p.at n=22A059668
- Primes which can be expressed as concatenation of powers of 4 and 0's.at n=17A066595
- Primes which can be expressed as concatenation of powers of 6 and 0's.at n=20A066597
- Third row of Pascal-(1,4,1) array A081579.at n=36A081587
- Primes such that a sum of any two adjacent digits is prime; first and last digits are considered adjacent.at n=41A086244
- Least number beginning with n such that every concatenation is a prime.at n=15A090506
- Prime numbers with prime sum of any two digits.at n=15A091939
- Prime numbers that are 2 less than a prime-indexed odd triangular number or 1 more than a prime-indexed even triangular number.at n=25A096333
- Prime numbers which when written in base 7 have a composite digit-sum.at n=28A096790
- Near-repunit primes.at n=28A105992
- Primes whose product of digits is 6.at n=15A107692
- Negative numbers written in a bits-of-Pi/primorial base system.at n=26A109839
- Smallest prime obtained by appending one or more 1's to n, -1 if no such prime exists.at n=15A112386