ℕ atory
Play Now

Properties of the Number 54957

Fifty-Four Thousand Nine Hundred Fifty-Seven

Basics

Value: 54956 → 54957 → 54958

Parity: odd

Prime: No

Previous Prime: 54949

Next Prime: 54959

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 7 × 2617

Divisors: 1, 3, 7, 21, 2617, 7851, 18319, 54957

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101011010101101

Octal: 153255

Duodecimal: 27979

Hexadecimal: d6ad

Square: 3020271849

Square Root: 234.4290937575795

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

T(n,k)=Number of nXk 0..2 white square subarrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value 2-x(i,j). A230652
T(n,k)=Number of nXk 0..1 arrays with every element unequal to 2, 3, 4, 5 or 7 king-move adjacent elements, with upper left element zero. A305022
T(n,k)=Number of nXk 0..2 black square subarrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value 2-x(i,j). A230661
T(n,k) = Number of n X k 0..1 arrays with every element unequal to 2, 3, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero. A316686
Number of nX4 0..2 white square subarrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value 2-x(i,j). A230648
Number of non-word-representable connected graphs on n vertices. A290814
Number of nX3 0..1 arrays with every element unequal to 2, 3, 4, 5 or 7 king-move adjacent elements, with upper left element zero. A305017
a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2p+1 + 2 - n and p is the unique integer such that 2p < n -1 <= 2p+1, with a(1) = 1, a(2) = 3, and a(3) = 4. A49977
Number of labeled connected Eulerian digraphs with n nodes. A54957