10828
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 18956
- Proper Divisor Sum (Aliquot Sum)
- 8128
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5412
- Möbius Function
- 0
- Radical
- 5414
- Omega Function (Ω)
- 3
- 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
- 42
- 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
- Number of sets of positive integers <= n^2 whose sum is (n^3 + n)/2.at n=5A007785
- Size of lexicographic code of length n, Hamming distance 6 and weight 6.at n=46A031504
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 56 ones.at n=25A031824
- a(n) = a(n-3) + a(n-5) with initial values 1,0,0,1,0.at n=60A052920
- Numbers n such that the sum of its aliquot parts and the number of its divisors are both perfect numbers.at n=2A070310
- Number of chess games that end in checkmate after exactly n plies.at n=6A079485
- a(n) = 11 + floor(Sum_{j-1..n-1} a(j)/4).at n=31A120168
- Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k columns ending at an even level (1<=k<=n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=31A121698
- a(n) = Sum_{k <= n/2 } binomial(n-2k, 3k).at n=20A137356
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (0, 1, -1), (1, 0, 0), (1, 1, 1)}.at n=7A150766
- Numbers n such that sigma(n) - n = perfect number (A000396).at n=7A237286
- Numbers k such that k^2 +/- (k-1) and (k-1)*k^2 +/- 1 are all primes.at n=21A239326
- Number of (n+1) X (1+1) arrays of permutations of 0..n*2+1 with each element having directed index change -2,0 -1,0 0,-1 or 1,1.at n=28A264622
- 5-untouchable numbers.at n=23A284187
- a(n) = Sum_k k*A333275(n,k).at n=10A333277
- Number of compositions of 5*n into parts 3 and 5.at n=12A369845
- Numbers k such that one or both of sigma(k) + k and sigma(k) - k is a perfect number.at n=8A382504
- The number of n-free abundant numbers below the least number k that is not n-free whose sum of n-free divisors is larger than 2*k.at n=2A387155
- a(n) = Sum_{k=0..floor(2*n/5)} binomial(2*n-2*k,3*k).at n=10A392401
- a(n) = Sum_{k=0..floor(2*n/3)} binomial(2*k,2*n-3*k).at n=15A392428