8748
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
- 4
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 22960
- Proper Divisor Sum (Aliquot Sum)
- 14212
- 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
- 2916
- Möbius Function
- 0
- Radical
- 6
- Omega Function (Ω)
- 9
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 78
- 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
- yes
- Achilles Number
- yes
- Perfect Power
- no
- Smooth Number
- yes
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- a(n) is smallest number > a(n-1) of form a(i)*a(j), i < j < n.at n=45A000423
- a(n) = max{(n - i)*a(i) : i < n}; a(0) = 1.at n=25A000792
- Index of (the image of) the modular group Gamma(n) in PSL_2(Z).at n=26A001766
- Numbers that are the sum of 4 positive 7th powers.at n=14A003371
- Expansion of (1+x)/(1-3*x).at n=8A003946
- Numbers that are the sum of at most 4 positive 7th powers.at n=34A004866
- The generalized Conway-Guy sequence w^{1}.at n=15A006755
- Numbers k such that phi(k) divides k.at n=57A007694
- a(n) = Product_{i=0..7} floor((n+i)/8).at n=25A009694
- a(n) = Product_{i=0..8} floor((n+i)/9).at n=25A009714
- a(n) = (2*n - 9)*n^2.at n=18A015243
- Numbers k such that the continued fraction for sqrt(k) has period 68.at n=28A020407
- a(1)=1, a(2)=2, a(n) = 4*3^(n-3) for n >= 3.at n=9A025579
- Numbers of form 3^i*4^j, with i, j >= 0.at n=34A025613
- Numbers of form 3^i*6^j, with i, j >= 0.at n=28A025614
- a(n) = Sum_{k=0..m} (k+1) * A026120(n, m-k), where m=0 for n=0,1; m=n for n >= 2.at n=8A027327
- Iterate the map in A006368 starting at 14.at n=50A028395
- A convolution triangle of numbers obtained from A036068.at n=21A030524
- Numbers k of the form 2^i*3^j, where i and j >= 1.at n=43A033845
- Expansion of (-1+1/(1-3*x)^3)/(9*x).at n=6A036068