Properties of the Number -62266

Sixty-Two Thousand Two Hundred Sixty-Six

Basics

Value: -62267 → -62266 → -62265

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 163 × 191

Divisors: 1, 2, 163, 191, 326, 382, 31133, 62266

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1111001100111010

Octal: -171472

Duodecimal: -3004A

Hexadecimal: -f33a

Square: 3877054756

Square Root: 249.53156113005025

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

Triangle read by rows: T(n,k) = number of ways to place k nonattacking kings on an n X n board. A193580

T(n,k)=Number of nXk 0..3 arrays with every 0 next to a 1, every 1 next to a 2 and every 2 next to a 3 horizontally, diagonally or antidiagonally, and no adjacent values equal. A232376

Number of ways to place 6 nonattacking kings on an n X n board. A172158

Triangle T(m,k) read by rows, where T(m,k) is the number of ways in which 1<=k<=m positions can be picked in an m X m square array such that all positions are mutually isolated. Two positions (s,t),(u,v) are considered as isolated from each other if min(abs(s-u),abs(t-v))>1. A98487

Number of ways to place n nonattacking kings on an n X n board. A201513

Triangle read by rows: T(n,k) is the maximum number of ways in which a set of integer-sided squares can tile an n X k rectangle, 0 <= k <= n. A362142

Number of ways to place 6 nonattacking kings on a 6 X n board. A172205

Array read by antidiagonals: T(n,k) is the number of ways to place k nonattacking kings on a n X k board. A390158

Maximum number of ways in which a set of integer-sided squares can tile an n X n square. A362143

Number of n X 2 0..3 arrays with every 0 next to a 1, every 1 next to a 2 and every 2 next to a 3 horizontally, diagonally or antidiagonally, and no adjacent values equal. A232370