10637
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
- 4
- Divisor Sum
- 11616
- Proper Divisor Sum (Aliquot Sum)
- 979
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9660
- Möbius Function
- 1
- Radical
- 10637
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 55
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- 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=14A015991
- a(1) = 2; a(n+1) = a(n)-th composite.at n=33A022450
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 24.at n=37A051965
- Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 9 sites wide.at n=47A058364
- a(n) = round(sqrt(a(n-2)^2 + a(n-1)^2)) with a(0) = 1 and a(1) = 2.at n=37A063827
- Numbers which need ten 'Reverse and Add' steps to reach a palindrome.at n=13A065215
- Row sums in triangle A081994.at n=19A081997
- "Rounded hypotenuses": a(n) = round(sqrt(a(n-1)^2 + a(n-2)^2)), a(1)=1, a(2)=3.at n=36A104804
- Semiprimes k=p*q such that the polynomial (1+x)^k (mod k) has p+q nonzero terms.at n=35A116926
- a(n) = n*L(n) + (n-1)*L(n-1) where L(n) is the Lucas number.at n=11A133673
- Numerator of the integral of x^n times the Cantor function, from 0 to 1.at n=6A159009
- Number of lines through at least 2 points of an 8 X n grid of points.at n=27A160848
- Numbers x such that 0 < |x^9 - y^2| < x^(7/2) for some number y.at n=6A173349
- Values x for records of the minima of the positive distance d between the ninth power of a positive integer x and the square of an integer y such that d = x^9 - y^2 (x <> k^2 and y <> k^9).at n=21A179791
- Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) >= number of parts of p.at n=42A241831
- Five-digit odd semiprimes with all digits distinct.at n=31A247948
- Pseudoprimes to base 9, written in base 9.at n=43A262154
- Triangle read by rows, the numerators of the Bell transform of B(n,1) where B(n,x) are the Bernoulli polynomials.at n=59A265314
- Number of n X 1 0..2 arrays with every repeated value in every row and column one larger mod 3 than the previous repeated value, and upper left element zero.at n=10A267946
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 499", based on the 5-celled von Neumann neighborhood.at n=23A272562