15187
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
- 15188
- 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
- 15186
- Möbius Function
- -1
- Radical
- 15187
- 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
- 177
- 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
- 1773
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes that remain prime through 3 iterations of function f(x) = 9x + 8.at n=35A023298
- Primes p from A031924 such that A052180(primepi(p)) = 11.at n=31A052232
- Primes with 2 representations: p*q*r - 1 = u*v*w + 1 where p, q, r, u, v and w are primes.at n=39A063644
- Number of primes between successive Fibonacci numbers inclusive.at n=28A076777
- Primes p such that both p-1 and p+1 have at most 3 prime factors, counted with multiplicity; i.e., primes p such that bigomega(p-1) <= 3 and bigomega(p+1) <= 3, where bigomega(n) = A001222(n).at n=45A079153
- Number of primes between successive Fibonacci numbers (including possibly the Fibonacci numbers themselves).at n=27A082602
- Primes p such that little googol + p is prime.at n=32A108255
- a(n) = number of solutions to the Diophantine equation x+y^2+z^3=n^4 with positive x,y,z.at n=18A121876
- Primes of the form 210k + 67.at n=36A140855
- Primes congruent to 6 mod 47.at n=38A142357
- Primes congruent to 46 mod 49.at n=39A142453
- Primes congruent to 29 mod 53.at n=35A142559
- Primes congruent to 24 mod 59.at n=28A142751
- Primes congruent to 59 mod 61.at n=30A142857
- Primes in A154935.at n=35A154936
- Primes p such that p^2 - 2 is a 5-almost prime.at n=19A156620
- 3-comma numbers: n occurs in the sequence S[k+1]=S[k]+10*last_digit(S[k-1])+first_digit(S[k]) for three different splittings n=concat(S[0],S[1]).at n=14A166513
- First of a run of 4 or more consecutive primes which all equal 1 (mod 3).at n=24A185942
- Primes p such that 10p+1 divides 2^p-1.at n=32A188133
- Triangle read by rows: row n gives the n primes corresponding to A187825.at n=41A195258