10480
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 24552
- Proper Divisor Sum (Aliquot Sum)
- 14072
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4160
- Möbius Function
- 0
- Radical
- 1310
- Omega Function (Ω)
- 6
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 148
- 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
- yes
- Odd
- no
Appears in sequences
- Fibonacci sequence beginning 1, 10.at n=16A022100
- a(n) = dot_product(1,2,...,n)*(3,4,...,n,1,2).at n=29A026037
- Expansion of 1/((1-6*x)*(1-7*x)*(1-9*x)*(1-10*x)).at n=3A028204
- a(n) = 3*a(n-1) - a(n-2) with a(0)=1, a(1)=11.at n=8A056123
- Number of reversible string structures with n beads using a maximum of six different colors.at n=9A056325
- Number of bracelets of length n using exactly four different colored beads.at n=8A056344
- Number of primitive (period n) bracelets using exactly four different colored beads.at n=8A056350
- Write the numbers from 1 to n^2 in a spiraling square; a(n) is the total of the sums of the two diagonals.at n=20A059924
- Tenth column (k=9) of sextinomial array A063260.at n=6A063264
- Generalized Stirling2 array (8,2).at n=22A092077
- a(n) = Sum_{k=0..floor(n/4)} C(n-2*k,2*k) * 3^k.at n=16A098576
- a(n) = Sum_{k=0..floor(n/2)} binomial(2n-2k,2k) * 3^(n-k).at n=8A108484
- a(n) = 14 + floor((1 + Sum_{j=1..n-1} a(j))/3).at n=23A120158
- Number of base 30 circular n-digit numbers with adjacent digits differing by 2 or less.at n=5A124958
- Numbers such that the sum of the factorials of the digits of the fourth power is a square.at n=17A126077
- Column 2 of triangle A128545; a(n) is the coefficient of q^(2n+4) in the central q-binomial coefficient [2n+4,n+2].at n=15A128552
- a(n) = A132878(n)/[(n+1)*(n+2)/2] for n>=0, where A132878 is column 1 of triangle A132870.at n=4A132879
- Triangle T(n,k) read by rows: number of k X k symmetric matrices with nonnegative integer entries and without zero rows or columns such that sum of all entries is equal to n, n>=1, 1<=k<=n.at n=43A138177
- Number of solutions to +-1 +- 3 +- 6 +- ... +- n(n+1)/2 = 0.at n=23A158380
- Number of descents in all involutions of {1,2,...,n}.at n=9A161125