16411
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 16412
- 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
- 16410
- Möbius Function
- -1
- Radical
- 16411
- 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
- 66
- 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
- 1901
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Next prime after 2^n.at n=14A014210
- Primes of the form 30*p + 1 where p is also prime.at n=40A051646
- Fifth term of weak prime quintets: p(m-3)-p(m-4) < p(m-2)-p(m-3) < p(m-1)-p(m-2) < p(m)-p(m-1).at n=41A054827
- a(n) = p is the smallest prime such that p = n + h(n)^2 and p is the first prime following h(n)^2. The smallest immediate post-square primes with distance n = p - h(n)^2.at n=26A058056
- Denoting 5 consecutive primes by p, q, r, s and t, these are the values of q such that q, r and s have 10 as a primitive root, but p and t do not.at n=36A060261
- a(1) = 1; a(n) = sum of terms in the continued fraction for the square of the continued fraction [a(1); a(2), a(3), a(4),..., a(n-1)].at n=21A061143
- a(n) = 2^n + 2*n - 1.at n=14A061761
- Primes which can be expressed as concatenation of powers of 4 and 0's.at n=19A066595
- Primes of the form sum 6d/(2 + mu(d)) for some k and all d dividing k.at n=30A069548
- Group the natural numbers such that the n-th group contains n terms and the group sum is the smallest possible prime: (2), (1, 4), (3, 5, 9), (6, 7, 8, 10), (11, 12, 13, 14, 17), (15, 16, 18, 19, 20, 21), ... Sequence gives group sums.at n=31A075345
- Initial term in sequence of four consecutive primes whose consecutive differences have d-pattern = [6, 4, 6]; short d-string notation for pattern = [646].at n=22A078856
- Primes p such that the differences between the 5 consecutive primes starting with p are (6,4,6,6).at n=5A078964
- Start with Pascal's triangle; form a triangle by sliding down n steps from top on both sides and including the horizontal row, deleting the inner numbers; a(n) = sum of entries on perimeter of triangle.at n=14A081494
- Prime mean of 8 horizontal, vertical and main diagonal sums associated with primes in A094454.at n=19A094455
- Prime numbers which when written in base 7 have a composite digit-sum.at n=31A096790
- Smallest prime equal to the sum of exactly 2n+1 distinct odd primes.at n=41A100694
- Primes of the form 2^k + 27.at n=7A104071
- Smallest prime >= 2^n.at n=14A104080
- Smallest prime >= 4^n.at n=7A104082
- Numbers n such that n+2*prime(n) is a perfect square.at n=39A104776