10793
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11088
- Proper Divisor Sum (Aliquot Sum)
- 295
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10500
- Möbius Function
- 1
- Radical
- 10793
- 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
- 117
- 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
- Denominators of continued fraction convergents to sqrt(537).at n=10A042027
- a(n) = floor(47*(n-3/2)^(3/2)).at n=37A050256
- a(n) = n^2 + (n + 1)^3 + (n + 2)^4.at n=8A061222
- Numbers k such that tau(k-1) = (tau(k))^2 = tau(k+1), where tau(k) = A000005(k) (number of divisors of k).at n=36A190266
- Number of partitions of n that have odd sized Ferrers matrix.at n=36A238944
- a(n) minimizes (over the integers) the absolute difference between Pi and x(n) + 1/a(n), where x(n) is Pi truncated at the n-th decimal digit.at n=4A286742
- Expansion of 1/(1 - x) * Product_{k>=0} 1/(1 - x^(3^k))^(3^(k+1)).at n=12A321344
- a(n) is the number of subsets of {1,2,...,n} with at least two elements and the difference between successive elements at least 6.at n=35A335184
- a(n) = Sum_{k=0..n} binomial(n+4*k,n-k) * Catalan(k).at n=6A360103