10282
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
- 8
- Divisor Sum
- 15876
- Proper Divisor Sum (Aliquot Sum)
- 5594
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4992
- Möbius Function
- -1
- Radical
- 10282
- 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
- 29
- 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) = (5*n + 1)^2 + 4*n + 1.at n=20A007533
- Numbers k such that the continued fraction for sqrt(k) has period 3.at n=27A013643
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 2 and 3 (mod 5).at n=55A035585
- Numbers n such that n | 6^n + 5^n + 4^n + 3^n.at n=13A057248
- Number of nonisomorphic cyclic subgroups of the group A_n X A_n (where A_n is the alternating group of degree n).at n=46A062365
- Indices of primes in sequence defined by A(0) = 71, A(n) = 10*A(n-1) + 41 for n > 0.at n=18A101143
- Number of permutations of floor(i*8/5), i=0..n-1, with all sums of 2 through 4 adjacent terms respectively unique.at n=7A147905
- Number of permutations of floor(i*8/5), i=0..n-1, with all sums of 2 through 5 adjacent terms respectively unique.at n=7A147914
- a(n) = 25*n^2 - 36*n + 13.at n=21A154355
- Numbers k such that 3^k + 2^k + 10 is prime.at n=16A219617
- Sphenic numbers (A007304) whose neighbors are sphenic.at n=21A248202
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 78", based on the 5-celled von Neumann neighborhood.at n=33A270093
- Tribonacci representation of 2^n, written in base 10.at n=12A305380
- Starting at n, a(n) is the number of times we move from a negative position to a spot we have already visited according to the following rules. On the k-th step (k=1,2,3,...) move a distance of k in the direction of zero. If the number landed on has been landed on before, move a distance of k away.at n=39A324683
- Number of maximal subsets of {1..n} containing no products of distinct elements.at n=38A325710
- a(n) is the total number of down steps between the first and second up steps in all 4_1-Dyck paths of length 5*n.at n=5A334651
- Number of fundamentally different graceful labelings of the n-cycle graph.at n=13A387796