Properties of the Number 56889

Fifty-Six Thousand Eight Hundred Eighty-Nine

Basics

Value: 56888 → 56889 → 56890

Parity: odd

Prime: No

Previous Prime: 56873

Next Prime: 56891

Digit Sum: 36

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 7 ² × 43

Divisors: 1, 3, 7, 9, 21, 27, 43, 49, 63, 129

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101111000111001

Octal: 157071

Duodecimal: 28B09

Hexadecimal: de39

Square: 3236358321

Square Root: 238.5141505236115

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

Hexagonal prism numbers: a(n) = (n + 1)*(3·n² + 3·n + 1). A5915

Table read by rows of numbers of unordered pairs of partitions of n-element set that have Rand distance k (n>=2, 1 <= k <= n(n-1)/2). A192100

The sum of the numbers on straight lines of incrementing length n when drawn over numbers of the square spiral, where each line contains numbers which sum to the minimum possible value, and each number on the spiral can only be in one line. If two or more lines exist with the same sum the one containing the smallest number is chosen. A340974

a(0) = 0, a(1) = 1; for n>0, a(2·n) = 3·a(2·n-1), a(2·n+1) = 3·a(2·n) - 2·a(n-1). A129770

Number of n X 2 binary arrays with all 1s connected, a path of 1s from left column to right column, and no 1 having more than two 1s adjacent. A163723

Number of n X 3 binary arrays with every 1 having exactly two king-move neighbors equal to 1. A183444

Numbers that set a new integer record for the ratio between the product and the sum of their digits. A240520

Numbers of the form A000217(n)*A007494(n) that are divisible by 3. A295867

Numerators of continued fraction for left factorial. A56889

Square array read by antidiagonals upwards: T(i,j) is the smallest number m such that the symmetric representation of σ, SRS(m), has maximum width 3, consists of i parts and has 2·j occurrences of maximum width 3 in its width pattern (row m of A341969). A377667