10259
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 10260
- 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
- 10258
- Möbius Function
- -1
- Radical
- 10259
- 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
- 148
- 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
- 1258
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 74.at n=38A020413
- Numbers with exactly five distinct base-10 digits.at n=17A031987
- Primes of the form 4*k^2 + 4*k + 59.at n=41A048988
- Primes p such that there is no Carmichael number pqr, p<q<r q, r primes.at n=10A051663
- Primes of form Sum_{k=1..n} (prime(k)+1).at n=27A062736
- Five-digit distinct-digit primes.at n=3A074671
- Chen primes p such that their p + 2 counterpart is a Sarrus number (pseudoprime to base 2).at n=2A109994
- A variation on Flavius's sieves (A000960, A099207): Start with the Chen primes; at the k-th sieving step, remove every (k+1)-st term of the sequence remaining after the (k-1)-st sieving step; iterate.at n=28A118500
- Primes for which the weight as defined in A117078 is 9 and the gap as defined in A001223 is 8.at n=31A118922
- A106486-encodings of combinatorial games equivalent to game {0|0}.at n=26A125994
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having k primitive non-Dyck factors (n>=0; 0<=k<=floor((n+1)/3)).at n=37A129157
- List of primitive prime divisors of the Somos-4 sequence (A006720) in their order of occurrence.at n=29A129741
- Primes congruent to 29 mod 31.at n=38A142033
- Primes congruent to 10 mod 37.at n=34A142119
- Primes congruent to 9 mod 41.at n=37A142206
- Primes congruent to 25 mod 43.at n=30A142274
- Primes congruent to 13 mod 47.at n=28A142364
- Primes congruent to 18 mod 49.at n=25A142429
- Primes congruent to 8 mod 51.at n=39A142481
- Primes congruent to 30 mod 53.at n=25A142560