8788
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 31
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 16660
- Proper Divisor Sum (Aliquot Sum)
- 7872
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4056
- Möbius Function
- 0
- Radical
- 26
- Omega Function (Ω)
- 5
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 96
- 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
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Generalized Fibonacci numbers A_{n,3}.at n=32A006208
- Eleven iterations of Reverse and Add are needed to reach a palindrome.at n=27A015992
- Denominator of sum of -3rd powers of divisors of n.at n=25A017670
- Numbers k such that the continued fraction for sqrt(k) has period 74.at n=25A020413
- a(n) = 4*n^3.at n=13A033430
- a(n) = ceiling((n^3)/2).at n=26A036486
- a(n) = floor((n^3)/2).at n=26A036487
- Numbers having three 8's in base 10.at n=15A043523
- Octahedral torus number: a(n) = n^2 + 2*(Sum_{k=1..n-1} k^2) - 2*(floor((n+1)/2)^2 + 2*(Sum_{k=1..floor((n+1)/2)-1} k^2)) + (1 - (-1)^n)/2.at n=25A050442
- Least k for which the integers Floor(k/m^2) for m=1,2,...,n are distinct.at n=29A054062
- Numbers which need eleven 'Reverse and Add' steps to reach a palindrome.at n=25A065216
- Largest proper divisor of n^3.at n=24A071378
- a(n) = C(1,1) + C(3,2) + C(5,3) + ... + C(2*n-1,n).at n=7A079309
- Nontrivial slowest increasing sequence whose succession of digits is that of the nonnegative integers.at n=44A098080
- Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k horizontal segments (a horizontal segment is a maximal string of horizontal steps).at n=28A104549
- Numbers n such that 2^(n+1)+2n+1 is prime.at n=29A105330
- Numbers n such that n + (sum of prime factors of n) = next prime after n.at n=20A105779
- Numbers of the form (2^i)*(13^j).at n=32A107326
- Numbers of the form (4^i)*(13^j), with i, j >= 0.at n=16A107462
- One fifth of the sum of the first n primes, when an integer.at n=22A112271