Properties of the Number -33978

Thirty-Three Thousand Nine Hundred Seventy-Eight

Basics

Value: -33979 → -33978 → -33977

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 7 × 809

Divisors: 1, 2, 3, 6, 7, 14, 21, 42, 809, 1618

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000010010111010

Octal: -102272

Duodecimal: -177B6

Hexadecimal: -84ba

Square: 1154504484

Square Root: 184.331223616619

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

T(n,k) = Number of n X k 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A280398

First row of infinite array A(j,k): A(j,1) = j-1; A(1,k) = A(2,k-1); for j, k > 1, A(j,k) = A(j-1,k) - A(j+1,k-1) if that number is positive and not already in column k, A(j,k) = A(j-1,k) + A(j+1,k-1) otherwise. A140985

Number of nX2 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A280392

Number of 1 X n 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A280399