10482
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20976
- Proper Divisor Sum (Aliquot Sum)
- 10494
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3492
- Möbius Function
- -1
- Radical
- 10482
- Omega Function (Ω)
- 3
- 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
- 86
- 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
- Number of Dyck paths of knight moves.at n=15A005223
- XOR-convolution of squares A000290 with themselves.at n=25A033460
- Low-temperature partition function expansion for square lattice (Potts model, q=4).at n=16A057381
- An approximation to sigma_{5/2}(n): round( sum_{d|n} d^(5/2) ).at n=37A058273
- An approximation to sigma_{5/2}(n): ceiling( sum_{d|n} d^(5/2) ).at n=37A058274
- Numbers which are the sum of their proper divisors containing the digit 4.at n=16A059463
- Next term is the sum of previous term and the square of the sum of its decimal digits, with a(0) = 10.at n=34A112787
- Number of permutations of length n which avoid the patterns 1234, 3421, 4312.at n=23A116756
- Row sums of triangle A131424.at n=40A131425
- Number of partitions of n having no more odd than even parts.at n=39A171966
- a(n+1) = a(n) + floor(a(n)/6) with a(0) = 6.at n=51A182307
- G.f.: A(x) = exp( Sum_{n>=1} x^n/n * Product_{k>=1} (1 + x^(n*k)) ).at n=21A218153
- G.f. satisfies: A(x) = 1 + Sum_{n>=1} 2*x^n * A(x)^(2*n^2).at n=5A218294
- The number of spheres on which the points defined by A222268 lie.at n=4A268020
- Least number x such that x^n has n digits equal to k. Case k = 8.at n=19A285455
- Triangle read by rows: T(n,k) is the number of chiral pairs of colorings of the edges of a regular n-D orthotope (or ridges of a regular n-D orthoplex) using exactly k colors. Row n has n*2^(n-1) columns.at n=7A338144
- Triangle read by rows: T(n,k) is the number of chiral pairs of colorings of the edges of a regular n-D orthoplex (or ridges of a regular n-D orthotope) using exactly k colors. Row 1 has 1 column; row n>1 has 2*n*(n-1) columns.at n=7A338148