Properties of the Number 8028

Eight Thousand Twenty-Eight

Basics

Value: 8027 → 8028 → 8029

Parity: even

Prime: No

Previous Prime: 8017

Next Prime: 8039

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 223

Divisors: 1, 2, 3, 4, 6, 9, 12, 18, 36, 223

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1111101011100

Octal: 17534

Duodecimal: 4790

Hexadecimal: 1f5c

Square: 64448784

Square Root: 89.59910713840847

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

a(n)-th and (a(n)+1)-st primes are the first pair of primes that differ by exactly 2n; a(n) = -1 if no such pair of primes exists. A38664

Generalized Stirling numbers, [n+2,3]_2: a(n) = n! * ∑_k=0..n-1 (k+1)/(n-k). A1705

Generalized Stirling number triangle of first kind read by rows: T(n, k) = [x^k] ∏_m=1..n (x - m - r), with r = 1. A49444

a(n) = A033001(n)/4. A43307

Unsigned 2-Stirling numbers of the first kind. A143491

Triangle generated by the asymptotic expansions of the E(x,m=2,n). A165674

Triangle read by rows. T(n, k) = (n - k + 1)! * H(k, n - k), where H are the hyperharmonic numbers. For 0 <= k <= n. A165675

Triangle of generalized Stirling numbers of the first kind read by rows: T(n, k) = (-1)^n+k*∑_m=0..n Stirling1(n, m) * binomial(m, k), where Stirling1 is A048994. A94645

Coefficient triangle for polynomials used for e.g.f.s for unsigned Stirling1 diagonals. A112486

Sums of distinct powers of 6. A33043