Properties of the Number -31529

Thirty-One Thousand Five Hundred Twenty-Nine

Basics

Value: -31530 → -31529 → -31528

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 41 × 769

Divisors: 1, 41, 769, 31529

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -111101100101001

Octal: -75451

Duodecimal: -162B5

Hexadecimal: -7b29

Square: 994077841

Square Root: 177.56407294269863

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

Array T(m,n) read by antidiagonals: number of domino tilings (or dimer tilings) of the m X n grid (or m X n rectangle), for m>=1, n>=1. A99390

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 horizontally and 1 0 1 vertically. A206871

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 horizontally and 0 1 1 vertically. A206936

Number A(n,k) of tilings of a 3k X n rectangle using 3n k-ominoes of shape I; square array A(n,k), n>=0, k>=0, read by antidiagonals. A251072

Triangle T(m,n) read by rows: number of domino tilings of the m X n grid (0 <= m <= n). A187616

Number of perfect matchings in graph P₇ X P_2n. A28469

Number of perfect matchings in graph P₆ X P_n. A28468

Sum of n-th prime squared and n-th perfect square. A106587

a(2·n+1) = 7·a(n), a(2·n+2) = 8·a(n) + a(n-1). A116554

n such that A205592(n) > n. A205594