8776
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16470
- Proper Divisor Sum (Aliquot Sum)
- 7694
- 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
- 4384
- Möbius Function
- 0
- Radical
- 2194
- Omega Function (Ω)
- 4
- 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
- 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
- a(1) = 5; a(n+1) = a(n)-th nonprime, where nonprimes begin at 0.at n=33A025001
- a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 1.at n=26A061511
- Number of planar planted trees with n non-root nodes and every 2-valent node isolated.at n=11A061639
- Maximal values in A038598.at n=45A093330
- 75-gonal numbers: a(n) = n*(73*n-71)/2.at n=16A098230
- Diagonal sums of number triangle A104881.at n=15A104882
- Numbers k such that k concatenated with k-4 gives the product of two numbers which differ by 9.at n=3A116133
- Sums of rows of the triangle in A116366.at n=36A116367
- This sequence needs a meaningful name.at n=15A121794
- a(1)=1. a(n) = sum of earlier terms, a(k) (1<=k<=n-1), where gcd(a(k),n) is squarefree.at n=17A122169
- Numbers k such that k and k^2 use only the digits 0, 1, 6, 7 and 8.at n=6A136876
- a(n) = 225*n + 1.at n=38A158229
- a(n) = 1 + n*(n+1)*(n-1)/2.at n=26A158842
- Partial sums of A118371.at n=42A173520
- G.f.: A(x) = Sum_{n>=0} x^n/[Sum_{k=0..n} C(n,k)^2*(-x)^k].at n=7A178324
- Smallest m such that n = sum of digits of A108971(m).at n=33A179988
- Sum of binary palindromes p < 2^n.at n=9A206918
- Sum of the first n binary palindromes; a(n) = Sum_{k=1..n} A006995(k).at n=46A206920
- Meandric numbers for a river crossing up to 5 parallel roads at n points.at n=11A208126
- Number of nX1 0..6 arrays with every element value z a city block distance of exactly z from another element value z.at n=9A209051