10687
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 10688
- 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
- 10686
- Möbius Function
- -1
- Radical
- 10687
- 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
- 99
- 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
- 1303
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers such that ten iterations of Reverse and Add are needed to reach a palindrome.at n=15A015991
- Numbers k such that the continued fraction for sqrt(k) has period 76.at n=30A020415
- Upper prime of a difference of 20 between consecutive primes.at n=17A031939
- Denoting 5 consecutive primes by p, q, r, s and t, these are the values of q such that q, r and s have 10 as a primitive root, but p and t do not.at n=21A060261
- Numbers k such that 100k+1, 100k+3, 100k+7, 100k+9 are all primes.at n=14A064687
- Numbers which need ten 'Reverse and Add' steps to reach a palindrome.at n=14A065215
- Five-digit distinct-digit primes.at n=23A074671
- Primes such that successive differences are distinct palindromes.at n=33A087582
- a(n)! is the smallest factorial divisible by the numerator of Sum_{k=0...n} 1/k!, with a(0) = 1.at n=10A102468
- Largest prime factor of numerator of Sum_{k=0...n} 1/k!, with a(0) = 1.at n=10A102469
- Primes p such that 2*p-27, 2*p+27, 2*p-33 and 2*p+33 are primes or -1 times primes.at n=20A103807
- Primes of the form 64n+63.at n=36A127579
- Integers of the form (x^3)/6 + (x^2)/2 + x + 1.at n=13A127876
- Primes p such that 3p-2 and 3p+2 are primes (see A125272) and its decimal representation ends in 7.at n=42A136204
- Primes congruent to 15 mod 29.at n=41A141991
- Primes congruent to 31 mod 37.at n=38A142140
- Primes congruent to 27 mod 41.at n=29A142224
- Primes congruent to 23 mod 43.at n=31A142272
- Primes congruent to 18 mod 47.at n=26A142369
- Primes congruent to 5 mod 49.at n=34A142418