Properties of the Number -32828

Thirty-Two Thousand Eight Hundred Twenty-Eight

Basics

Value: -32829 → -32828 → -32827

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 29 × 283

Divisors: 1, 2, 4, 29, 58, 116, 283, 566, 1132, 8207

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1000000000111100

Octal: -100074

Duodecimal: -16BB8

Hexadecimal: -803c

Square: 1077677584

Square Root: 181.18498834064593

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+1)X(k+1) 0..1 arrays with the difference of the upper median and minimum value of each 2X2 subblock in lexicographically nondecreasing order rowwise and columnwise. A235660

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with the difference of the upper median and minimum value of each 2X2 subblock in lexicographically nondecreasing order columnwise and nonincreasing rowwise. A236523

Number of (n+1) X (1+1) 0..1 arrays with the difference of the upper median and minimum value of each 2 X 2 subblock in lexicographically nondecreasing order rowwise and columnwise. A235653

a(n) is the graph corresponding to A076184(n), encoded as in A382754. A382756

Number of (not necessarily maximal) cliques in the n-sun graph. A295904

Integers k such that A005245(m·k) < A005245(k) for some m. A380464