Properties of the Number 8052

Eight Thousand Fifty-Two

Basics

Value: 8051 → 8052 → 8053

Parity: even

Prime: No

Previous Prime: 8039

Next Prime: 8053

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 11 × 61

Divisors: 1, 2, 3, 4, 6, 11, 12, 22, 33, 44

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1111101110100

Octal: 17564

Duodecimal: 47B0

Hexadecimal: 1f74

Square: 64834704

Square Root: 89.73293709669822

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

sigma₅(n), the sum of the 5th powers of the divisors of n. A1160

Array read by downwards antidiagonals: sigma_k(n) for n >= 1, k >= 0. A109974

a(n) = 1 + ∑_i=1..n (n-i+1)*φ(i). A5598

Square array A(n,k), n >= 1, k >= 0, read by antidiagonals: A(n,k) = ∑_d∣n (-1)^n/d+d*d^k. A322083

Base-9 Armstrong or narcissistic numbers (written in base 10). A10353

Numbers k such that k | sigma₅(k). A55709

Base 9 perfect digital invariants (written in base 10): numbers equal to the sum of the k-th powers of their base-9 digits, for some k. A162234

Triangle read by rows, T(n,m) = sigma_n-m(m) for n >= 1, m = 1,2, ..., n. A279394

Sum of the 5th powers of the squarefree divisors of n. A351268

a(n) = n⁵ * ∏_{p∣n, p prime} (1 + 1/p⁵). A351300