10607
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 10608
- 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
- 10606
- Möbius Function
- -1
- Radical
- 10607
- 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
- 55
- 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
- 1294
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes of the form k^2 - 2.at n=26A028871
- Numbers whose set of base-15 digits is {2,3}.at n=22A032815
- Multiplicity of highest weight (or singular) vectors associated with character chi_145 of Monster module.at n=38A034533
- a(n) = prime(n)^2 - 2.at n=26A049001
- Primes of form p^2 - 2, where p is prime.at n=13A049002
- a(n) is the first prime p from A031924 such that A052180(primepi(p)) = prime(n).at n=24A052229
- Primes p of form q^k-2 where q is also a prime and k > 1.at n=18A053705
- Largest prime below prime(n)^2 (A001248).at n=26A054270
- a(n) = Sum_{d|n} d*prime(d).at n=43A061150
- Primes of form Sum_{k=1..n} (prime(k)+1).at n=28A062736
- Primes of the form p*q + p + q, where (p, q=p+2) are twin primes.at n=6A065017
- Safe primes (A005385) (p and (p-1)/2 are primes) such that 8*p+1 (A023228) is also prime.at n=31A075706
- 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=38A080437
- Primes in A051022.at n=26A092908
- Interpolate 0's between each pair of digits of n-th prime.at n=38A092909
- Primes that are 2 less than a perfect power m^k, k >= 2.at n=29A094786
- Primes of the form p*q + p + q, where p and q are two successive primes.at n=15A096342
- Primes of the form m^k-k, with m and k > 1.at n=36A099228
- Prime differences of tribonacci numbers.at n=16A113239
- 2*JacobiSymbol(p,5) mod p^2 for p=prime(n).at n=26A113651