15277
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 15278
- 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
- 15276
- Möbius Function
- -1
- Radical
- 15277
- 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
- 32
- 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
- 1784
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of partitions satisfying cn(0,5) + cn(2,5) + cn(3,5) <= cn(1,5) + cn(4,5).at n=37A039879
- Primes followed by a [10,2,10] prime difference pattern of A001223.at n=18A052376
- Primes p such that x^67 = 2 has no solution mod p.at n=27A059330
- Rounded total surface area of a regular icosahedron with edge length n.at n=42A071398
- Least k for the Theodorus spiral to complete n revolutions.at n=38A072895
- Balanced primes of order twelve.at n=10A096704
- Primes connected to two primes by the (p+1)/2 and 2p-1 operators.at n=37A109835
- a(n) = prime(prime(n*n) - n*n) - n*n where prime(n) is the n-th prime.at n=17A141127
- Primes congruent to 2 mod 47.at n=36A142355
- Primes congruent to 38 mod 49.at n=40A142446
- Primes congruent to 13 mod 53.at n=34A142543
- Primes congruent to 55 mod 59.at n=29A142782
- Primes congruent to 27 mod 61.at n=27A142825
- Primes p such that continued fraction of (1 + sqrt(p))/2 has period 3.at n=36A146348
- Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 1101-0111-0010 pattern in any orientation.at n=10A147242
- Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 1101-0111-0010 pattern in any orientation.at n=22A147244
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (0, -1, 1), (0, 1, 1), (1, 1, -1), (1, 1, 0)}.at n=7A150879
- Primes of the form 25n^2-14n+2 for n >= 0.at n=8A154356
- a(n) = 25*n^2 - 14*n + 2.at n=25A154357
- Primes p such that p^2 - 2 is a 5-almost prime.at n=20A156620