Properties of the Number 57681

Fifty-Seven Thousand Six Hundred Eighty-One

Basics

Value: 57680 → 57681 → 57682

Parity: odd

Prime: No

Previous Prime: 57679

Next Prime: 57689

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 13 × 17 × 29

Divisors: 1, 3, 9, 13, 17, 29, 39, 51, 87, 117

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1110000101010001

Octal: 160521

Duodecimal: 29469

Hexadecimal: e151

Square: 3327097761

Square Root: 240.16869071550522

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

a(n) = n*(5·n²-8·n+5)/2. A226449

Pseudoprimes to base 8 that are not squarefree. A243090

Maximal term of TRIP-Stern sequence of level n corresponding to permutation triple (e,23,e). A271488

Number of nX2 1..3 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in increasing order. A166814

Number of n X 5 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 1 1 0 vertically. A207700

a(n) = ∑_{m=0..floor((n-1)/2)} prime((n-m)(n-m-1)/2+m+1). A249490

Negated inverse Euler transform of {-1 if n is a triangular number else 0, n > 0} = -A010054. A320784

a(n) = ∑_{j=0..floor(n/3)} (-1)^j*binomial(n,3·j). A57681

T(n,k) = Number of n X k 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 1 1 0 vertically. A207703