Properties of the Number 56723

Fifty-Six Thousand Seven Hundred Twenty-Three

Basics

Value: 56722 → 56723 → 56724

Parity: odd

Prime: No

Previous Prime: 56713

Next Prime: 56731

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 131 × 433

Divisors: 1, 131, 433, 56723

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1101110110010011

Octal: 156623

Duodecimal: 289AB

Hexadecimal: dd93

Square: 3217498729

Square Root: 238.16590855955855

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 (n+1)X(k+1) binary arrays with rows and columns in nondecreasing order and with no 2X2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one. A184071

Smallest m such that (sum of binary digits of m*(m+1)/2) = n. A211201

a(n) = k is the smallest number such that 3·k+1 contains n distinct prime factors. A356872

Number of (n+1)X6 binary arrays with rows and columns in nondecreasing order and with no 2X2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one. A184067

Number of (n+2) X (3+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 3 5 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 3 5 6 or 7. A252379

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 1), (0, 0, 1), (1, 0, -1), (1, 1, 1)}. A150814

Number of (n+1)X(n+1) binary arrays with rows and columns in nondecreasing order and with no 2X2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one. A184062

Minimal length of a sequence with terms from {1, 2, 3, ..., n} which contains, as a subsequence, each possible ordering of the n symbols 1, 2, 3, ..., n. A62714

Numbers k such that 8·10^k + 3·R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k. A56723

Number of (n+1)X(5+1) 0..1 arrays with no 2X2 subblock having the minimum of its diagonal elements greater than the absolute difference of its antidiagonal elements. A251225