15559
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 15560
- 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
- 15558
- Möbius Function
- -1
- Radical
- 15559
- 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
- 84
- 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
- 1815
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 82 ones.at n=14A031850
- Fifth term of strong prime quintets: p(m-3)-p(m-4) > p(m-2)-p(m-3) > p(m-1)-p(m-2) > p(m)-p(m-1).at n=35A054812
- a(n) is the smallest prime m such that prod(m) = n*length(m)*sum(m) where prod(m) is the product of the digits of m, length(m) is the number of digits of m, sum(m) is the sum of the digits of m; or 0 if no such m exists.at n=8A064023
- Primes with either no internal digits or all internal digits are 5.at n=53A069680
- Primes p such that the sum of the digits of p is not prime, but the sum of the squares of the digits of p is prime.at n=24A091362
- (2n+1)-digit anti-palindromic numbers or numberdromes, whose first and last digits add to ten, second and next-to-last add to ten and so on with the central digit a 5.at n=13A093472
- Smallest prime equal to the sum of exactly 2n+1 distinct odd primes.at n=40A100694
- Lesser prime in pair prime(k) +/- k for some k.at n=28A107636
- a(0) = 0, a(1) = a(2) = 1, a(3) = 2, a(4) = 4, a(5) = 8, a(6) = 16, for n>5: a(n+1) = SORT[ a(n) + a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5) + a(n-6)], where SORT places digits in ascending order and deletes 0's.at n=39A108567
- Primes p2 such that p1^3 + p2^2 is an average of twin primes and p1 < p2 are consecutive primes.at n=10A138755
- Primes congruent to 2 mod 47.at n=37A142355
- Primes congruent to 30 mod 53.at n=35A142560
- Primes congruent to 42 mod 59.at n=34A142769
- Primes congruent to 4 mod 61.at n=32A142802
- 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, -1, 0), (-1, 0, 1), (0, 1, 0), (1, -1, 0), (1, 1, -1)}.at n=10A148196
- Primes containing the string 555.at n=2A167281
- Primes of the form 9*k^3+7.at n=4A201301
- Primes of the form 3n^2 + 7.at n=12A201479
- Lexicographically earliest permutation of the primes such that successive absolute differences yield a permutation of all nonprime numbers.at n=11A203985
- Prime numbers consisting of only odd digits such that there is only one permutation of its digits that produces a prime number.at n=16A225421