Properties of the Number -33004

Thirty-Three Thousand Four

Basics

Value: -33005 → -33004 → -33003

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 37 × 223

Divisors: 1, 2, 4, 37, 74, 148, 223, 446, 892, 8251

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1000000011101100

Octal: -100354

Duodecimal: -17124

Hexadecimal: -80ec

Square: 1089264016

Square Root: 181.67003054989559

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

Perrin sequence (or Perrin numbers, or Ondrej Such sequence): a(n) = a(n-2) + a(n-3) with a(0) = 3, a(1) = 0, a(2) = 2. A1608

Partial sums of A299272. A299273

Integers that are Rhonda numbers to base 15. A100974

Number of irreducible positions of size n in Montreal solitaire. A7048

Number of minimal total dominating sets in the n-cycle graph. A300738

a(n) = round(rⁿ) where r is the smallest Pisot number (real root r=1.3247179.. of x³-x-1). A205579

a(n) = floor(rⁿ) where r is the smallest Pisot number (real root r=1.3247179... of x³-x-1). A112639

Perrin numbers which are divisible by their digital root. A117959

Number of length 3 1..(n+1) arrays with every leading partial sum divisible by 2, 3 or 5. A254830

a(n) = number of primes between n² and n⁴. A380332