8826
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17664
- Proper Divisor Sum (Aliquot Sum)
- 8838
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2940
- Möbius Function
- -1
- Radical
- 8826
- 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
- 47
- 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 partitions satisfying cn(2,5) + cn(3,5) <= cn(1,5) and cn(2,5) + cn(3,5) <= cn(4,5).at n=41A039877
- Number of partitions satisfying cn(1,5) <= cn(2,5) + cn(3,5) and cn(4,5) <= cn(2,5) + cn(3,5).at n=35A039890
- Numbers which are the sum of their proper divisors containing the digit 4.at n=14A059463
- Solution to the Dancing School Problem with 4 girls and n+4 boys: f(4,n).at n=10A079909
- Number of initial odd numbers in class n of the iterated phi function.at n=31A092878
- Number of partitions that are "3-close" to being self-conjugate.at n=40A108962
- a(n) = (n^3 + 3*n - 2)/2.at n=25A132127
- Numbers k such that the numerator of the Bernoulli number B(2k) ends with the digits 691.at n=33A132184
- Numbers k such that k and k^2 use only the digits 2, 6, 7, 8 and 9.at n=6A137118
- 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, 1, -1), (1, -1, 1), (1, 0, 0), (1, 1, 1)}.at n=7A150531
- Number of right triangles with nonnegative integer coordinates less than or equal to n and one corner at the origin.at n=40A155154
- Number of ordered septuples of distinct pairwise coprime positive integers with largest element n.at n=33A186978
- Number of Motzkin paths of length n with no level steps at height 1.at n=13A217312
- Number of partitions of n with product of multiplicities of parts equal to 8.at n=49A266691
- Numbers n that have an equal number of even and odd values of A001221(k) for 1 <= k <= n.at n=15A275547
- Number of nX3 0..1 arrays with every element equal to 0, 1, 2, 4 or 7 king-move adjacent elements, with upper left element zero.at n=15A298489
- a(1)=1. For n > 1, a(n) is the n-th positive integer after a(n-1) which cannot be written as a sum of distinct preceding terms in the sequence.at n=15A343017
- a(n) = coefficient of x^n in A(x) = Sum_{n>=0} x^n*F(x)^n * (1 - x^n*F(x)^n)^n, where F(x) = 1 + x*F(x)^3 is a g.f. of A001764.at n=8A357793
- Numbers k such that there exists a pair of primes (p,q) with p+q = k such that p*q + k, p*q - k, p*q + A001414(k) and p*q - A001414(k) are all prime.at n=47A358132
- Number of partitions of n such that 4*(least part) + 1 = greatest part.at n=56A363076