10613
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 10614
- 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
- 10612
- Möbius Function
- -1
- Radical
- 10613
- 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
- 29
- 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
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1295
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that (6^k - 1)/5 is prime.at n=11A004062
- Primes of form k^2 + 4.at n=21A005473
- Primes of the form p^2 + 4, where p is prime.at n=10A045637
- Primes remaining prime if any digit is deleted (zeros allowed).at n=30A051362
- Primes such that the sum of the factorials of the digits is a perfect square.at n=28A052279
- Smallest prime larger than square of n-th prime.at n=26A062772
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 99 ).at n=38A063372
- Prime(n) and prime(n+2) use the same digits.at n=19A069794
- For n < 5, a(n) = n-th prime. For n >= 5, let m = n-th prime. If m is a k-digit prime then a(n) = smallest prime obtained by inserting at least one digit between every pair of digits of m. There are (k-1) places where digit insertion takes place and a(n) contains at least 2k-1 digits.at n=37A080437
- Largest prime factor of 3^n+2.at n=19A080443
- Duplicate of A045637.at n=10A094481
- Primes of the form n^2 + 4n + 8.at n=20A098062
- Smallest prime factor of A104357(n) = A104350(n) - 1.at n=35A104358
- Sum of the primes in ordered 3 X 3 prime squares.at n=21A105089
- Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and such that the sum of the bottom levels of all columns is k (n>=1, k>=0; informally, the number of the "missing" cells in the right bottom corner of the polyomino). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=50A122104
- Primes p such that |100-p|, |1000-p|, |10000-p| and |100000-p| are also primes.at n=16A126021
- A list of pairs of consecutive primes identified by the first in the pair. A number can be found between these two primes that divides the sum of all primes up to this prime.at n=3A130825
- Associate each least prime signature value with the corresponding prime number.at n=43A133928
- Primes for which the period of the reciprocal equals (p-1)/14.at n=10A135073
- Primes congruent to 31 mod 37.at n=37A142140