10359
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
- 14976
- Proper Divisor Sum (Aliquot Sum)
- 4617
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6900
- Möbius Function
- 0
- Radical
- 3453
- 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
- 117
- 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
- Number of n-node unrooted quartic trees; number of n-carbon alkanes C(n)H(2n+2) ignoring stereoisomers.at n=16A000602
- Expansion of (Product_{j>=1} (1-(-x)^j) - 1)^9 in powers of x.at n=22A001487
- a(n) = floor( n*(n-1)*(n-2)/23 ).at n=63A011905
- Duplicate of A000602.at n=16A080091
- Number of permutations of length n which avoid the patterns 1234, 2143, 3421.at n=19A116842
- Numbers k such that there are 9 digits in k^2 and for each factor f of 9 (1,3) the sum of digit groupings of size f is a square.at n=21A153747
- a(n) = (2*n^3 + 9*n^2 + n + 24) / 6.at n=30A160805
- G.f. is the polynomial (1-x^3) * (1-x^6) * (1-x^9) * (1-x^12) * (1-x^15) * (1-x^18) / (1-x)^6.at n=17A162539
- First occurrence of n consecutive n's in the decimal expansion of the Euler-Mascheroni constant.at n=3A224826
- a(n) = Sum_{i=0..n} digsum_3(i)^4, where digsum_3(i) = A053735(i).at n=45A231505
- Number of 3-separable partitions of n; see Comments.at n=54A239469
- Number of partitions p of n such that the number of parts having multiplicity 1 is not a part and max(p) - min(p) is a part.at n=48A241448
- Partial sums of A247666.at n=44A253767
- a(n) = 4*n^3 - 3*n^2 - 2*n - 1.at n=14A268644
- Odd coefficients in Sum_{n>=0} (x^n + i)^n / (1 + i*x^n)^(n+1), in which the constant term is taken to be 1.at n=6A323687
- G.f.: Sum_{n>=0} (x^n + i)^n / (1 + i*x^n)^(n+1), in which the constant term is taken to be 1.at n=36A323689
- Maximum of the smallest sum of increasing concatenations of a permutation of {1, ..., n}.at n=8A328862
- a(1) = 1; a(n) = Sum_{k=2..n} (-1)^k * k^2 * a(floor(n/k)).at n=34A361981
- a(1) = 1; a(n) = Sum_{k=2..n} (-1)^k * k^2 * a(floor(n/k)).at n=35A361981