15107
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 15108
- 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
- 15106
- Möbius Function
- -1
- Radical
- 15107
- 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
- 133
- 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
- 1765
- 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) = 5x + 6.at n=37A023285
- Number of partitions of n such that cn(0,5) = cn(2,5) < cn(3,5) = cn(4,5) < cn(1,5).at n=66A036858
- Prime number spiral (clockwise, Southeast spoke).at n=21A054564
- First term of strong prime quintets: p(m+1)-p(m) > p(m+2)-p(m+1) > p(m+3)-p(m+2) > p(m+4)-p(m+3).at n=34A054808
- a(n) = Lucas(n+1) - (n+1).at n=18A066982
- Primes p that remain prime through at least 2 iterations of the function f(p) = p^2 + 4.at n=31A116886
- Primes congruent to 14 mod 43.at n=40A142263
- Primes congruent to 20 mod 47.at n=38A142371
- Primes congruent to 2 mod 53.at n=39A142532
- Primes congruent to 3 mod 59.at n=30A142730
- Primes congruent to 40 mod 61.at n=30A142838
- Least a(n) such that M(n)*(M(n)+a(n))-1 and M(n)*(M(n)+a(n))+1 are twin primes with M(i)=i-th Mersenne prime.at n=10A143385
- Least prime a(n) such that M(n)*(M(n)+a(n))-1 and M(n)*(M(n)+a(n))+1 are twin primes with M(i)=i-th Mersenne prime A000043(i).at n=10A143387
- Primes congruent to 32 mod 67.at n=28A154621
- Prime numbers where the last digit is the sum of all the previous digits.at n=26A156617
- Primes p such that p^3 + p^2 - 1 and p^3 + p^2 + 1 are prime.at n=37A160859
- Number of n element 0..2 arrays with each element the minimum of 6 adjacent elements of a random 0..2 array of n+5 elements.at n=14A217881
- First prime p such that (p+n)^2+n is prime but (p+j)^2+j is not prime for all 0<j<n.at n=39A238673
- a(n) = prime(n^2+1).at n=42A243896
- Sequence derived from arithmetic relations between powers of phi (A001622): a(n) = phi^n - (-1)^n * (n - phi^-n).at n=20A248924