ℕ atory
Play Now

Properties of the Number -167089

One Hundred Sixty-Seven Thousand Eighty-Nine

Basics

Value: -167090 → -167089 → -167088

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 13 × 12853

Divisors: 1, 13, 12853, 167089

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

375 Try Today's Challenge

Representations

Binary: -101000110010110001

Octal: -506261

Duodecimal: -80841

Hexadecimal: -28cb1

Square: 27918733921

Square Root: 408.76521378414776

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 of the 2m X 2n grid (m>=0, n>=0). A187617
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 P6 X Pn. A28468
Number of perfect matchings in graph P8 X Pn. A28470
Triangle T(m,n) read by rows: number of domino tilings of the 2m X 2n grid (0 <= m <= n). A187618
Triangle read by rows: order of all-2s configuration on the n X k sandpile grid graph. A256045
Triangle read by rows: T(m, n) is the number of symmetric recurrent sandpiles on an m X n grid (m >= 0, 0 <= n <= m). A348566
6th row of array in A099390. A256044
The maximal number of different domino tilings allowed by the Ferrers-Young diagram of a single partition of 2n. A304790