Properties of the Number -32641

Thirty-Two Thousand Six Hundred Forty-One

Basics

Value: -32642 → -32641 → -32640

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 7 × 4663

Divisors: 1, 7, 4663, 32641

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -111111110000001

Octal: -77601

Duodecimal: -16A81

Hexadecimal: -7f81

Square: 1065434881

Square Root: 180.66820417549957

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

Number of semi-lone-child-avoiding locally disjoint rooted trees with n unlabeled leaves. A331874

T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any king-move neighbor in a random 0..2 nXk array. A218319

T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, vertical or antidiagonal neighbor in a random 0..3 nXk array. A218372

a(n) = 2^n-1*(2ⁿ - 1) + 1. A134169

Product representation of the Pell numbers A000129 and A002203. A72280

a(n) = abs(2ⁿ-127). A176303

a(n) = ∑_j=1..n ∑_k=1..n φ(j·k) / φ(k). A372636

a(n) = a(n-1) + a(n-2) + 2 a([(n-1)/2]), where a(0) = 1, a(1) = 1, a(2) = 1. A298354

Expansion of 1/((1-5x)(1-6x)(1-9x)). A19793

Hilltop maps: number of n X 3 binary arrays indicating the locations of corresponding elements not exceeded by any king-move neighbor in a random 0..2 n X 3 array. A218314