Properties of the Number -32126

Thirty-Two Thousand One Hundred Twenty-Six

Basics

Value: -32127 → -32126 → -32125

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 16063

Divisors: 1, 2, 16063, 32126

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -111110101111110

Octal: -76576

Duodecimal: -16712

Hexadecimal: -7d7e

Square: 1032079876

Square Root: 179.23727290940352

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 odd p-trees of weight n (all proper terminal subtrees have odd weight). A300436

Triangular array generated by its row sums: T(n,0)=1 for n >= 0, T(1,1)=2, T(n,k)=T(n,k-1)+d·r(n-k) for k=2,3,...,n, d=(-1)^k+1, n >= 2, r(h)=sum of the numbers in row h of T. A54098

Sum of the two smallest parts from the partitions of 4n into 4 parts with smallest part = 1. A239059

T(n,k)=Equals one maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and vertical neighbors in a random 0..2 nXk array. A220545

Equals one maps: number of nX3 binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and vertical neighbors in a random 0..2 nX3 array. A220543

T(n,2), array T as in A054098. A54104