13499
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 13500
- 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
- 13498
- Möbius Function
- -1
- Radical
- 13499
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 182
- 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
- 1600
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = prime(n^2).at n=39A011757
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (composite numbers), t = (odd natural numbers).at n=33A025104
- a(n) = prime(100*n).at n=15A031921
- Fourth term of weak prime quintets: p(m-2)-p(m-3) < p(m-1)-p(m-2) < p(m)-p(m-1) < p(m+1)-p(m).at n=29A054826
- 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=28A054827
- Fifth term of weak prime sextet: p(m-3)-p(m-4) < p(m-2)-p(m-3) < p(m-1)-p(m-2) < p(m)-p(m-1) < p(m+1)-p(m).at n=1A054832
- Numbers k such that k^14 == 1 (mod 15^3).at n=15A056087
- Smallest prime p such that x = n is a solution mod p of x^3 = 2, or 0 if no such prime exists.at n=28A059940
- Primes p = prime(k) such that prime(k) + prime(k+7) = prime(k+1) + prime(k+6) = prime(k+2) + prime(k+5) = prime(k+3) + prime(k+4).at n=7A064102
- a(1) = 2, then a(n) = greatest prime factor of (a(n-1)^2+2).at n=7A081173
- Let R be the polynomial ring GF(2)[x]. Then a(n) = number of distinct products f*g with f,g in R and 0 <= deg(f),deg(g) <= n.at n=6A086908
- Diagonal of A088262.at n=39A088263
- a(n) = the first prime in the orbit of n under f(n) = n + the first prime > n, or 0 if no such prime exists.at n=48A089750
- Prime means of 12 horizontal, vertical and main diagonal sums associated with primes in A094458.at n=8A094459
- Beginning with 3, least prime such that concatenation of first n terms and its digit reversal both are primes.at n=19A113584
- Numbers k such that k + phi(k) + phi(phi(k)) is a repdigit.at n=20A116027
- Primes for which the weight as defined in A117078 is 15 and the gap as defined in A001223 is 14.at n=19A118380
- Primes of the form a^2 + b^2 + c^2 such that a^4 + b^4 + c^4 is prime as well and larger than the first one.at n=30A126118
- Primes of the form 210k + 59.at n=32A140852
- Primes congruent to 10 mod 41.at n=37A142207