10810
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 20736
- Proper Divisor Sum (Aliquot Sum)
- 9926
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4048
- Möbius Function
- 1
- Radical
- 10810
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 161
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = floor(n*(n-1)*(n-2)/9).at n=47A011891
- Numbers whose sum of divisors is a fourth power.at n=21A019422
- Number of rooted 4-dimensional "polycubes" with n cells, with no symmetries removed.at n=4A048665
- Array read by antidiagonals: T(n,k) = number of rooted n-dimensional polycubes with k cells, with no symmetries removed (n >= 1, k >= 1).at n=32A048790
- Smallest multiple of n beginning and ending in n and having a digit sum of n, or 0 if no such number exists.at n=9A077739
- Smallest multiple of n beginning and ending in n and with a digit sum that is divisible by n.at n=9A078213
- Square table T, read by antidiagonals, where T(n,k) gives the number of n-th generation descendents of a node labeled (k) in the tree of tournament sequences.at n=50A093729
- Column 5 of A048790.at n=4A094161
- Number of tournament sequences: a(n) gives the number of n-th generation descendents of a node labeled (5) in the tree of tournament sequences.at n=4A113079
- Numbers k such that k and k^2 use only the digits 0, 1, 5, 6 and 8.at n=13A136870
- Greatest number m such that the fractional part of Pi^A153711(m) >= 1-(1/m).at n=6A153715
- Greatest number m such that the fractional part of Pi^A153712(n) >= 1-(1/m).at n=7A153716
- Denominators of rationals with e.g.f. D(3,x), a Debye function.at n=44A227571
- Trajectory of 1496 under repeated application of the map defined in A053392.at n=3A328974
- a(n) = n * Sum_{d|n} binomial(d+3,4)/d.at n=19A343545
- Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 2 + 3*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - 2*x - x^2.at n=31A367297
- Upper (2/3)-midsequence of binomial(n,3) and binomial(n,2); see Comments.at n=46A390345