16097
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 16098
- 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
- 16096
- Möbius Function
- -1
- Radical
- 16097
- 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
- 45
- 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
- 1874
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Smallest prime p such that the product of q/(q-1) over the primes from prime(n) to p is greater than 2.at n=29A001275
- Sum of (Gaussian) q-binomial coefficients for q=-12.at n=4A015177
- a(n) = T(n,n-3), T given by A026568. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=3.at n=10A026572
- Duplicate of A026572.at n=10A026588
- Primes p from A031924 such that A052180(primepi(p)) = 17.at n=18A052234
- Number of primes <= 3^n.at n=11A055729
- McKay-Thompson series of class 24I for Monster.at n=28A058579
- Solutions k of the equation phi(k) = phi(k-1) + phi(k-2). Also known as Phibonacci numbers.at n=23A065557
- Number of primes < 3^prime(n).at n=4A086692
- Prime numbers of the form primepi(3^m), for some integer m.at n=2A087865
- Numbers p such that p = (prime(n)+ prime(n+2))/2 is prime for prime indices n=2, 3, 5...at n=19A098038
- Indices of primes in sequence defined by A(0) = 41, A(n) = 10*A(n-1) + 61 for n > 0.at n=5A101732
- a(0) = 0, a(1) = 5; for n>1, a(n) is determined by the rule that the concatenation of the leading terms of the difference triangle is the same as the concatenation of the digits of the sequence.at n=12A125003
- McKay-Thompson series of class 24I for the Monster group with a(0) = 2.at n=28A138688
- Primes congruent to 15 mod 43.at n=40A142264
- Primes congruent to 23 mod 47.at n=39A142374
- Primes congruent to 25 mod 49.at n=40A142435
- Primes congruent to 38 mod 53.at n=37A142568
- Primes congruent to 49 mod 59.at n=27A142776
- Primes congruent to 54 mod 61.at n=31A142852