Properties of the Number 57040

Fifty-Seven Thousand Forty

Basics

Value: 57039 → 57040 → 57041

Parity: even

Prime: No

Previous Prime: 57037

Next Prime: 57041

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ⁴ × 5 × 23 × 31

Divisors: 1, 2, 4, 5, 8, 10, 16, 20, 23, 31

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101111011010000

Octal: 157320

Duodecimal: 29014

Hexadecimal: ded0

Square: 3253561600

Square Root: 238.83048381645088

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

Consider a number x > 1. Take the sum of its digits. Repeat the process deleting the first addendum and adding the previous sum. The sequence lists the numbers that after some iterations reach the Euler totient function of x. A269310

a(n) = n*(n+1)*(2·n+1)*(3·n+1)/6. A11195

Number of (n+1) X 2 binary arrays with every 2 X 2 subblock trace equal to some horizontal or vertical neighbor 2 X 2 subblock trace. A185742

Numbers k such that 405·2^k+1 is prime. A323102

T(n,k)=Number of (n+1)X(k+1) binary arrays with every 2X2 subblock trace equal to some horizontal or vertical neighbor 2X2 subblock trace. A185750

T(n,k) = Number of (n+1) X (k+1) binary arrays with every 2 X 2 subblock trace equal to exactly one or two horizontal and vertical neighbor 2 X 2 subblock traces. A186939

Number of {2,3}-regular graphs; i.e., labeled simple graphs (no multi-edges or loops) on n vertices, each of degree 2 or 3. A110040

Let R(i,j) be the rectangle with antidiagonals 1; 2,3; 4,5,6; ...; each k is an R(i(k),j(k)) and A057040(n)=i(F(n)), where F(n) is the n-th Fibonacci number. A57040