10481
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10752
- Proper Divisor Sum (Aliquot Sum)
- 271
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10212
- Möbius Function
- 1
- Radical
- 10481
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 148
- 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
- 3-Bell numbers: E.g.f.: exp(3*z + exp(z) - 1).at n=6A005494
- Congruence classes of triangles which can be drawn using lattice points in n X n grid as vertices.at n=15A028419
- a(0)=2; a(n) is the smallest k > a(n-1) such that the fractional part of k^(1/11) starts with n.at n=32A034076
- Number of partitions of n into parts not of form 4k+2, 20k, 20k+7 or 20k-7. Also number of partitions in which no odd part is repeated, with at most 3 parts of size less than or equal to 2 and where differences between parts at distance 4 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=49A036027
- An approximation to sigma_{5/2}(n): floor( sum_{d|n} d^(5/2) ).at n=37A058272
- Sum of numbers in n-th upward diagonal of triangle in A079826.at n=40A079825
- Numbers n such that A003313(n) = A003313(2n).at n=40A086878
- Binomial transform of A003418.at n=8A100442
- Array, read by antidiagonals, where A(n,k) = exp(-1)*Sum_{i>=0} (i+k)^n/i!.at n=48A108087
- Smith numbers of order 2.at n=41A174460
- Numerators of coefficients of Maclaurin series for (1-x-x^2)^(-1/2).at n=7A178694
- Number of arrays of 5 integers in -n..n with sum zero and equal numbers of elements greater than zero and less than zero.at n=7A201813
- Triangle read by rows of operator ordering coefficients corresponding to the Legendre polynomials L_n(x).at n=28A225694
- Triangle read by rows of operator ordering coefficients corresponding to the Legendre polynomials L_n(x).at n=35A225694
- Quotients connected with the Banach matchboxes problem: Sum_{i=1..prime(n)-7} 2^(i-1)*binomial(i+2,3)/prime(n) (case 3).at n=3A238697
- Number of partitions of n such that (least part) < (multiplicity of greatest part).at n=44A240178
- G.f.: 1/((1-t^11)^2*(1-t)*(1-t^3)*(1-t^5)*(1-t^7)*(1-t^9)*(1-t^13)*(1-t^15)*(1-t^17)*(1-t^19)*(1-t^21)).at n=59A266751
- Least number x such that x^n has n digits equal to k. Case k = 2.at n=16A285449
- Number of complete compositions of n whose run-lengths cover an initial interval of positive integers.at n=16A329749
- E.g.f. A(x) satisfies A(x) = exp(x * A(x) / (1 - x*A(x)^2)) / (1 - x*A(x)^2).at n=4A380768