Properties of the Number -32728

Thirty-Two Thousand Seven Hundred Twenty-Eight

Basics

Value: -32729 → -32728 → -32727

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ³ × 4091

Divisors: 1, 2, 4, 8, 4091, 8182, 16364, 32728

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111111111011000

Octal: -77730

Duodecimal: -16B34

Hexadecimal: -7fd8

Square: 1071121984

Square Root: 180.90881681112174

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

Irregular array where the n-th row are the divisors, not occurring earlier in the sequence, of the sum of the terms in all previous rows. a(1)=3. A120577

a(0) = 4; for n>0, a(n) = a(n-1) + 2ⁿ - 3. A249453

Number of nonisomorphic 2-graphs with n nodes with first and second cohomology invariants both 0. A6627

a(n) = 8ⁿ - 8n. A198398

Coefficients of mock modular form H₂⁴ (divided by 2). A256052

Triangle T(n,k) read by rows: coefficients of polynomials P_n(t) defined in Formula section. A278457

Number of maximal irredundant sets in the n-wheel graph. A291063

Coefficients of J(0)*theta₃(z) where J(0) is sequence A056945. A56946

Number of 1..32 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1. A171306

Number of 1..n integer arrays v[1..3] of length 3 with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..2. A171340