10881
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
- 16
- Divisor Sum
- 17920
- Proper Divisor Sum (Aliquot Sum)
- 7039
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6480
- Möbius Function
- 0
- Radical
- 1209
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 3
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 179
- 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
- a(n) = Sum_{d|n} sigma(n/d)*d^3.at n=20A027847
- Expansion of 1/((1-x)^2(1-x^2)(1-x^3)(1-x^5)) in powers of x.at n=47A028291
- A unitary phi reciprocal amicable number: consider two different numbers r, s which satisfy the following equation for some integer k: uphi(r) = uphi(s) = (1/k) * r * s / (r-s); or equivalently, 1/uphi(r) = 1/uphi(s) = k * (1/s - 1/r); sequence gives r numbers.at n=10A080766
- a(n) = n*(n^2+3*n-1)/3.at n=31A084990
- Numerators of Newton-Cotes formulas.at n=47A093735
- First differences of A014292.at n=28A104862
- a(0) = 0, a(1) = 1; for n >= 2, a(n) = a(n-1) + a(n-2) - n if that number is positive and not already in the sequence, otherwise a(n) = a(n-1) + a(n-2) + n.at n=21A117823
- Result of using the positive integers 1,2,3,... as coefficients in an infinite polynomial series in x and then expressing this series as Product_{k>=1} (1+a(k)x^k).at n=31A147654
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (0, -1, -1), (0, 0, 1), (1, 1, 0)}.at n=8A149983
- Number of planar triangular n X n X n nonnegative integer grids with mirror symmetry about one altitude with every similarly oriented 5 X 5 X 5 subtriangle summing to 9.at n=2A154075
- G.f.: A(q) = exp( Sum_{n>=1} A002129(n) * 3*A038500(n) * q^n/n ).at n=20A161804
- A trisection of A161804: a(n) = A161804(3n+2) for n>=0.at n=6A161807
- a(n) = smallest k having at least three prime divisors d such that (d + n) | (k + n).at n=38A202158
- Number of singular 2 X 2 matrices having all elements in {-n,...,n}.at n=16A209981
- Principal diagonal of the convolution array A213841.at n=12A213842
- Number of enhanced partial matchings of n elements treatable by "PTR" (Procedure Triple Reverse).at n=11A220872
- a(n) = Sum_{i=0..n} digsum_9(i)^3, where digsum_9(i) = A053830(i).at n=37A231686
- Number of nonnegative integers with property that their base 9/7 expansion (see A024655) has n digits.at n=30A245429
- Number of length 2+2 0..n arrays with some pair in every consecutive three terms totalling exactly n.at n=19A245871
- Number of ON cells at n-th stage in simple 2-dimensional cellular automaton (see Comments lines for definition).at n=56A256530