16451
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
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 16452
- 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
- 16450
- Möbius Function
- -1
- Radical
- 16451
- 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
- 115
- 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
- 1907
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/5.at n=40A001135
- Molien series for cyclic group of order 5.at n=35A008646
- Primes that remain prime through 3 iterations of function f(x) = 2x + 9.at n=32A023276
- Number of ways to partition n elements into pie slices of different sizes.at n=33A032153
- Schoenheim bound L_1(n,5,4).at n=34A036832
- Numbers k such that [A070080(k), A070081(k), A070082(k)] is an integer Heronian triangle having triangular area.at n=18A070148
- Primes p such that x^5 = 2 has a solution mod p, but x^(5^2) = 2 has no solution mod p.at n=12A070182
- Numbers n for which there are exactly six k such that n = k + reverse(k).at n=40A072430
- Let n range through the odd numbers skipping multiples of 5; a(n) = n-th prime ending in n.at n=20A089779
- a(n) = lesser of a pair of twin primes p, q=p+2 such that product of first n primes plus p is a prime and also product of first n primes plus q is a prime.at n=42A090795
- "Secondary twin primes": a(n) = A006450(A096477(n)).at n=38A096479
- a(n) = (-1)^n * coefficient of x^n in Sum_{k>=1} x^(k-1)/(1+4*x^k).at n=7A101562
- Round(1000*x), where x is the solution to x = 3^(n-x).at n=19A103537
- Twin prime pairs k-1 and k+1 such that the squares of both are present in A115557.at n=44A115560
- Primes of the form 210n+71.at n=38A140856
- Primes congruent to 21 mod 53.at n=39A142551
- Primes congruent to 49 mod 59.at n=29A142776
- Primes congruent to 42 mod 61.at n=29A142840
- 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=27A155032
- Honaker emirps: terms in A033548 that are emirps.at n=26A161118