13103
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 13104
- 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
- 13102
- Möbius Function
- -1
- Radical
- 13103
- 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
- 138
- 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
- yes
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1559
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of partitions into non-integral powers.at n=17A000263
- n is prime and is the concatenation of numbers n_1, n_2, n_3, in that order, with n_1 - n_2 = n_3. (Do not allow leading zeros for nonzero n_i.)at n=15A067861
- Iterates of A014580, starting with a(0) = 1, a(n) = A014580^(n)(1). [Here A014580^(n) means the n-th fold application of A014580].at n=7A091230
- Least prime p such that sigma(x)=sigma(p) has exactly n solutions.at n=31A115374
- Least number k such that binomial(2k,k) is divisible by all squares to n squared but not (n+1) squared, or 0 if impossible.at n=30A118562
- Numbers n such that (2^p + 1)/3 is prime, where p is the n-th prime.at n=35A123176
- Primes q such that (2^p + 1)/3 is prime, where p = Prime[q]; or primes in A123176[n].at n=9A123214
- Primes of the form p^3 + q^3 + r^3, where p, q and r are primes.at n=25A123597
- Numbers k such that (11^k - 3^k)/8 is prime.at n=9A128027
- Prime numbers n such that n = p1^3 + p2^3 + p3^3, a sum of cubes of 3 distinct prime numbers.at n=6A137365
- Subsequence of A137365 where it is possible to choose p1, p2, p3 so that p1+p2+p3 = prime.at n=6A137366
- Numbers which are the sum of 3 cubes of distinct odd primes.at n=36A138853
- Primes of the form 2*3*5*7*n+83.at n=32A141570
- Primes congruent to 24 mod 41.at n=36A142221
- Primes congruent to 31 mod 43.at n=37A142280
- Primes congruent to 37 mod 47.at n=34A142388
- Primes congruent to 20 mod 49.at n=33A142431
- Primes congruent to 12 mod 53.at n=32A142542
- Primes congruent to 13 mod 55.at n=35A142610
- Primes congruent to 50 mod 57.at n=40A142696