Properties of the Number -442791

Four Hundred Forty-Two Thousand Seven Hundred Ninety-One

Basics

Value: -442792 → -442791 → -442790

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 49199

Divisors: 1, 3, 9, 49199, 147597, 442791

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1101100000110100111

Octal: -1540647

Duodecimal: -1942B3

Hexadecimal: -6c1a7

Square: 196063869681

Square Root: 665.4254278279423

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 triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n²) is the number of ways to tile an n X n chessboard with k rook-connected polyominoes of equal area. A348452

Irregular triangle read by rows: T(n,k) (n >= 1, 1 <= k <= number of divisors of n²) is the number of ways to tile an n X n chessboard with d_k rook-connected polyominoes of equal area, where d_k is the k-th divisor of n². A348453

Irregular triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n²) is the number of ways to tile an n X n chessboard with rook-connected polyominoes of area k. A348454

Irregular triangle read by rows: T(n,k) (n >= 1, 1 <= k <= number of divisors of n²) is the number of ways to tile an n X n chessboard with rook-connected polyominoes of area d_k, where d_k is the k-th divisor of n². A348455

T(n,m) = Number of ways to partition an nXm grid into 4 connected equal-area regions. A167260