15013
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 15014
- 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
- 15012
- Möbius Function
- -1
- Radical
- 15013
- 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
- 164
- 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
- 1755
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Smallest prime in class n (sometimes written n+) according to the Erdős-Selfridge classification of primes.at n=6A005113
- Primes of the form m^2 + 3m + 9, where m can be positive or negative.at n=35A005471
- Prime(n)*...*a(n) is the least product of consecutive primes which is non-deficient.at n=28A007686
- Prime(n)*...*a(n) is the least product of consecutive primes which is abundant.at n=28A007708
- Let Dedekind's psi(m) = product of (p+1)p^(e-1) for primes p, where p^e is a factor of m. Iterating psi(m) eventually results in a number of form 2^a*3^b. a(n) is the smallest number that requires n steps to reach such a number.at n=7A019268
- Numbers k such that the continued fraction for sqrt(k) has period 45.at n=38A020384
- Sum{T(n,k)}, k = 0,1,...,n, where T is the array defined in A024996.at n=10A026080
- a(n) = Sum{a(k): k=0,1,2,...,n-3,n-1}; a(n-2) is not a summand; 2 initial terms required.at n=17A049855
- Fifth term of weak 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=36A054827
- Sixth term of weak prime sextet: p(m-4)-p(m-5) < 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=3A054833
- Smallest prime p such that p+2 has exactly n distinct prime factors.at n=4A067024
- Prime(n) and prime(n+2) use the same digits.at n=23A069794
- a(n) is the n-th prime whose decimal expansion begins with the decimal expansion of n.at n=14A077345
- Class 7+ primes.at n=0A081635
- Primes of the form primorial(P(k))/2-2.at n=3A087398
- Primes P of the form P=(j*P(i)#)/2 - 2 such that P+4 is the next prime, where j is odd, 0 < j < P(i+1), P(i) = i-th prime, P(i)# = i-th primorial (A002110).at n=6A087820
- Smallest prime p such that p+2 is a product of exactly n distinct primes.at n=4A098027
- Primes resulting from A100276.at n=3A100277
- Primes of the form primorial(P(k))/2-2^n with minimal n, n>=0, k>=2.at n=4A103513
- Indices of records in A109631.at n=31A109640