Properties of the Number 57057

Fifty-Seven Thousand Fifty-Seven

Basics

Value: 57056 → 57057 → 57058

Parity: odd

Prime: No

Previous Prime: 57047

Next Prime: 57059

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 × 11 × 13 × 19

Divisors: 1, 3, 7, 11, 13, 19, 21, 33, 39, 57

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101111011100001

Octal: 157341

Duodecimal: 29029

Hexadecimal: dee1

Square: 3255501249

Square Root: 238.86607126170097

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 both the sum of n+1 consecutive integers and the sum of the n immediately higher consecutive integers. A59270

-3-Knödel numbers. A225507

Odd numbers with exactly 5 distinct prime factors. A46391

Numerators of triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) is the coefficient of x^2k+1 in polynomial u_n(x), used to approximate x->sin(π*x)/π. A144846

Denominators of the Faulhaber polynomials. A335952

a(n) is the smallest number that has exactly n odious divisors (A000069). A355968

a(n) = number of (s(0), s(1), ..., s(n)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 2, s(n) = 4. Also a(n) = T(n,n-2), where T is the array in A026323. A26327

Numbers n such that φ(n) = φ(n+11), with Euler's totient function φ = A000010. A276504

a(n) = n*(2·n + 1)*(4·n + 1). A316224

Primitive cubic pyritohedral numbers: a(n) = 864·n³ - 2484·n² + 2384·n - 763. A391165