8964
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 23520
- Proper Divisor Sum (Aliquot Sum)
- 14556
- 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
- 2952
- Möbius Function
- 0
- Radical
- 498
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 47
- 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
- a(n) = T(n,n-4), T given by A026584. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=4.at n=9A026589
- Smallest k for which k, 2k, ... nk all contain the digit 8.at n=6A039939
- Smallest k for which k, 2k, ... nk all contain the digit 8.at n=5A039939
- Denominators of continued fraction convergents to sqrt(945).at n=9A042829
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 97 ).at n=23A063370
- Numbers k such that sigma(k) = 2*usigma(k).at n=25A063880
- Difference between the largest and the smallest n-digit prime.at n=3A073862
- Numbers that have exactly six prime factors counted with multiplicity (A046306) whose digit reversal is different and also has 6 prime factors (with multiplicity).at n=14A109026
- a(n) is the smallest number m such that the sum of the digits of n+m is n.at n=34A130692
- a(n) = A131668(n) - (2*n+1).at n=17A131766
- Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=8.at n=16A135193
- A090801(2n-1)+A090801(2n).at n=24A140958
- a(n) = 2*n^3 - 3*n^2 + 5.at n=17A152064
- Sum of all primes from n-th prime to (2*n-1)-th prime.at n=35A161463
- G.f.: A(q) = exp( Sum_{n>=1} sigma(n) * 3*A038500(n) * q^n/n ), where A038500(n) = highest power of 3 dividing n.at n=10A163129
- A trisection of A163129.at n=3A163131
- Row sums of A163233 and A163235.at n=22A163242
- Number of binary strings of length n with no substrings equal to 0010 1011 or 1100.at n=15A164502
- Number of 3-step one space at a time bishop's tours on an n X n board summed over all starting positions.at n=28A187156
- Number of nondecreasing arrangements of n numbers in -(n+2)..(n+2) with sum zero and not more than two numbers equal.at n=6A188231