Properties of the Number -57324

Fifty-Seven Thousand Three Hundred Twenty-Four

Basics

Value: -57325 → -57324 → -57323

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 17 × 281

Divisors: 1, 2, 3, 4, 6, 12, 17, 34, 51, 68

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: -1101111111101100

Octal: -157754

Duodecimal: -29210

Hexadecimal: -dfec

Square: 3286040976

Square Root: 239.42430954270287

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) is the number of 2 X 2 matrices with elements 1..n where at least one row and at least one column is strictly increasing. A390922

Triangle read by rows, M·Q; M = (T(n,k) = A155728(n-k+1)); Q = (A155728·0^n-k). A155729

Draw a square and follow these steps: Take a square and place at its edges isosceles right triangles with the edge as hypotenuse. Draw a square at every new edge of the triangles. Repeat for all the new squares of the same size. New figures are only placed on empty space. The structure is symmetric about the first square. The sequence gives the numbers of squares of equal size in successive rings around the center. A265207

Number of n X 2 0..1 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly one mistake. A278670

Number of length n inversion sequences avoiding the patterns 100 and 120. A374549

a(n+3) = a(n+2) + 3a(n+1) - 2a(n); a(0) = 1, a(1) = -1, a(2)= 3. A104005