Properties of the Number 33078

Thirty-Three Thousand Seventy-Eight

Basics

Value: 33077 → 33078 → 33079

Parity: even

Prime: No

Previous Prime: 33073

Next Prime: 33083

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 37 × 149

Divisors: 1, 2, 3, 6, 37, 74, 111, 149, 222, 298

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000000100110110

Octal: 100466

Duodecimal: 17186

Hexadecimal: 8136

Square: 1094154084

Square Root: 181.8735824687027

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) = n*(n+1)*(4·n+5)/6. A16061

The sum of the elements within a jump in a Sieve of Eratosthenes table. A179545

Row sums of triangle A120072 (numerator triangle for H atom spectrum). A120074

Number of 4-tuples (w,x,y,z) with all terms in {1,...,n} and w·x>2·y*z. A211797

Number of partitions of n such that the (sum of distinct odd parts) > n/2. A284614

Number of partitions of n such that the (sum of distinct odd parts) >= n/2. A284615

Row sums of triangle A144825. A144826

Irregular triangle read by rows: T(n,k) is the number of unlabeled connected n-node graphs with intersection number (or edge clique cover number) k; n >= 1, 0 <= k <= floor(n²/4). A355755

Number of minimal total dominating sets in the n-dipyramidal graph. A298823

a(n) = ∑_k=0..n σ(k² + 1), where σ(k) is the sum of divisors of k (A000203). A333172