10737
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 15522
- Proper Divisor Sum (Aliquot Sum)
- 4785
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7152
- Möbius Function
- 0
- Radical
- 3579
- Omega Function (Ω)
- 3
- 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
- 73
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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 k such that the continued fraction for sqrt(k) has period 80.at n=37A020419
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Lucas numbers), t = (F(2), F(3), F(4), ...).at n=13A025092
- T(n,n-3), array T as in A054106.at n=39A054107
- a(n) = smallest m >= 1 such that Sum_{k=1..m} log(k)/k >= n.at n=43A092753
- Number of partitions of n with rank 2 (the rank of a partition is the largest part minus the number of parts).at n=50A101199
- Denominators of the continued fraction convergents of the decimal concatenation of the even natural numbers.at n=5A128843
- a(n) = 729*n - 198.at n=14A156772
- Rectangular array, read by antidiagonals, where row e.g.f.s, R(n,x), satisfy: d/dx log( R(n,x) ) = R(n+1,x)^(2^n) with R(n,0) = 1; that is, the logarithmic derivative of the e.g.f. of row n equals the e.g.f. of row n+1 to the 2^n power, for n>=0.at n=32A159314
- Arises in the maximum number of C5's in a triangle-free graph.at n=32A185721
- G.f.: A(x) = 1 + Sum_{n>=1} x^(n^2) * ((1-x)^n + 1/(1-x)^n).at n=42A197707
- Numbers n such that (2^(n+7)*5^(n+6)-1024877)/9 is prime (n > 0).at n=12A266963
- G.f.: Product_{k>=1} (1 + x^k) / (1 - x^(k*(k+1)/2)).at n=31A280422
- a(n) = 21*2^n - 15.at n=9A305158
- Odd numbers for which sigma(k) is congruent to 2 modulo 4 and the 3-adic valuation of k is one larger than the 3-adic valuation of sigma(k).at n=38A351534
- Number of subsets of {1,2,...,n} such that no two elements differ by 2, 3, or 5.at n=26A375982
- Expansion of e.g.f. 1/(1 - sin(3*x) / 3).at n=7A381286