8772
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
- 4
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 22176
- Proper Divisor Sum (Aliquot Sum)
- 13404
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2688
- Möbius Function
- 0
- Radical
- 4386
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 140
- 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
- Sum of fourth powers: 0^4 + 1^4 + ... + n^4.at n=8A000538
- a(n) = 1^n + 2^n + ... + 8^n.at n=4A001555
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite BEA = Beta Na7[Al7Si57O128] starting with a T1 atom.at n=12A019067
- a(n) = (d(n)-r(n))/2, where d = A026060 and r is the periodic sequence with fundamental period (1,0,0,0).at n=38A026061
- Every run of digits of n in base 16 has length 2.at n=33A033014
- Positive integers having more base-16 runs of even length than odd.at n=35A044842
- Triangle of rooted planar maps up to orientation-preserving isomorphisms.at n=51A046653
- Number of factorizations into distinct factors with 2 levels of parentheses indexed by prime signatures. A050347(A025487).at n=47A050348
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 8 skipped primes.at n=43A050775
- Number of lucky numbers (A000959) <= 10^n.at n=5A055723
- Numbers which contain exactly the same digits (with the correct multiplicity) in 3 different smaller bases.at n=16A059828
- Numbers k > 1 such that, in base 4, k and k^2 contain the same digits in the same proportion.at n=30A061658
- Numbers k such that binomial(2k,k)+1 is prime.at n=32A066699
- Convolution of Fibonacci F(n+1), n>=0, with F(n+5), n>=0.at n=11A067333
- Numbers k such that 2^k + 3^(k-1) is prime.at n=43A082400
- Sums of (one or more distinct) k-perfect numbers.at n=45A083865
- Take the list t(n,0) = {1,...,n}; denote by t(n,j) this list after rotating to left (or right) by j positions. Calculate inner product of t(n,0) and t(n,j) and denote the value by s(n,j). Compute this inner product for all j = 1..n and choose the smallest. This is a(n).at n=33A088003
- Numbers k such that 216*k+108 is a term of A097703 and A007494 and A098240.at n=8A098241
- {a(n)} is monotone increasing, with a(1)=1, a(2)=3 and, for n>2, a(n) is the smallest integer such that a(n) mod a(j) is never a(i) for any pair i,j with 1<=i<j<n.at n=43A100812
- a(1) = 1; a(n) = 2*a(n-1) + (number of digits in a(n-1)).at n=12A117079