13007
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
- 13008
- 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
- 13006
- Möbius Function
- -1
- Radical
- 13007
- 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
- 63
- 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
- 1550
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that 227*2^k+1 is prime.at n=13A032490
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n-1 <= 2^(p+1), with a(1) = 1, a(2) = 3, and a(3) = 2.at n=15A049920
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 1.at n=31A050043
- Smallest member of a pair of consecutive twin prime pairs that have exactly n primes between them.at n=19A089637
- Numbers k such that 216*k+108 is a term of A097703 and A007494 and A098240.at n=12A098241
- Let p = prime(sigma(n)) and q = prime(phi(n)), then p is in the sequence if p-q = 6.at n=18A103176
- Largest prime of the set of four consecutive primes whose sum of digits is a set of four distinct primes.at n=30A106818
- Primes p such that little googol - p is prime.at n=30A108256
- Indices of records in A064844.at n=12A135988
- Prime quadruples: 3rd term.at n=12A136721
- Primes of the form k^2 + 11.at n=8A138362
- Primes congruent to 10 mod 41.at n=34A142207
- Primes congruent to 21 mod 43.at n=38A142270
- Primes congruent to 35 mod 47.at n=30A142386
- Primes congruent to 22 mod 49.at n=34A142432
- Primes congruent to 22 mod 53.at n=27A142552
- Primes congruent to 27 mod 55.at n=36A142620
- Primes congruent to 27 mod 59.at n=27A142754
- Primes congruent to 14 mod 61.at n=26A142812
- Primes p such that p$ - 1 is also prime. Here '$' denotes the swinging factorial function (A056040).at n=16A163080