15359
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
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 15360
- 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
- 15358
- Möbius Function
- -1
- Radical
- 15359
- 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
- 239
- 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
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1794
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 8.at n=17A022313
- a(n) = T(2, n), where T is the array given by A047858.at n=11A047859
- Least prime in A001359 (lesser of twin primes) such that the distance (A053319) to the next twin is 6*n.at n=36A052350
- Least m which can be written as i*j+i+j in n different ways: A072670(m)=n.at n=21A072671
- Primes p such that 5 is the largest of all prime factors of the numbers between p and the next prime (cf. A052248).at n=15A080185
- a(n) is the smallest x such that the quotient d(x+1)/d(x) equals n, where d = A000005.at n=21A080371
- Smaller member of a twin prime pair such that the sum sets a record for number of prime divisors (counted with multiplicity).at n=7A086827
- Smallest member of a pair of consecutive twin prime pairs that have exactly n primes between them.at n=21A089637
- Smallest prime between 2^n and 2^(n+1), having a maximal number of 1's in binary representation.at n=12A091938
- Primes with a single 0 bit in their binary expansion.at n=27A095078
- Primes A005382(n) + A005384(n) - 1 with a twin prime A005382(n) + A005384(n) + 1.at n=22A099109
- Least prime p such that sigma(x)=sigma(p) has exactly n solutions.at n=24A115374
- Primes congruent to 37 mod 47.at n=39A142388
- Primes congruent to 22 mod 49.at n=40A142432
- Primes congruent to 42 mod 53.at n=32A142572
- Primes congruent to 19 mod 59.at n=31A142746
- Primes congruent to 48 mod 61.at n=28A142846
- 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, 1), (-1, 0, 1), (-1, 1, 0), (1, -1, -1), (1, 1, 1)}.at n=8A149556
- 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, 1), (-1, 0, 0), (-1, 1, -1), (1, -1, 0), (1, 1, 1)}.at n=8A149558
- Primes p where |p-m| = 1, where m is any of the smallest positive integers with their number of divisors. (m belongs to sequence A007416.)at n=37A152245