Properties of the Number 32808

Thirty-Two Thousand Eight Hundred Eight

Basics

Value: 32807 → 32808 → 32809

Parity: even

Prime: No

Previous Prime: 32803

Next Prime: 32831

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 1367

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 1367, 2734

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1000000000101000

Octal: 100050

Duodecimal: 16BA0

Hexadecimal: 8028

Square: 1076364864

Square Root: 181.12978772140158

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

Numbers that are the sum of 8 nonzero 8th powers. A3386

Numbers k such that the cumulative sums of the k-th composition in graded reverse lexicographic order ("standard order", see A066099) do not cover all residue classes modulo p for any prime p; i.e., such that (0, x₁, ..., x₁+...+x_j) is an admissible prime tuple pattern, where (x₁, ..., x_j) is the k-th composition. A387383

a(n) = n⁵ + 5n. A180355

Number of partitions of n with even minimal part and odd maximal part. A325344

Sorted positions of first appearances in the run-compression (A037201) of the first differences (A001223) of the prime numbers (A000040). A376521

a(n) = 1728·n - 24. A157287

Table T(n,k) read by upward antidiagonals. T(n,k) is the minimum value of ∑_i=1..n ∏_j=1..k r[(i-1)*k+j] among all permutations r of {1..kn}. A331889

a(n) = ∑_{d∣n, d odd} (n/d)^d. A333823

Position of first appearance of 2n in the run-compression (A037201) of the first differences (A001223) of the prime numbers (A000040). A376520

a(n) = 8ⁿ + 8·n. A221910