Properties of the Number 57357

Fifty-Seven Thousand Three Hundred Fifty-Seven

Basics

Value: 57356 → 57357 → 57358

Parity: odd

Prime: No

Previous Prime: 57349

Next Prime: 57367

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 6373

Divisors: 1, 3, 9, 6373, 19119, 57357

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1110000000001101

Octal: 160015

Duodecimal: 29239

Hexadecimal: e00d

Square: 3289825449

Square Root: 239.49321493520438

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

Numbers n such that n and the four successive integers produce primes if substituted for·in the polynomial 5x²+5x+1. See A090562, A090563. Terms show that longer similar chains also exist. A90100

a(n+2) = a(n+1) + a(n) - (2·n + 1) where a(0)=7, a(1)=11. A88981

Least positive integer k such that ∑_i=1..k φ(i) >= 10ⁿ. A343802

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, 0, 0), (-1, 1, 0), (1, -1, -1), (1, 1, 0)}. A149088

a(n) = floor(3·n/7). A57357

Triangle t(n,m)= (m²-1) * binomial(n,m) * (n+2)/(n+2-m) read by rows, 0<=m<=n. A137388

Least k starting a chain of (2n+1) consecutive integers {h(k+i)}, i=0,1,...,2n, where h(k) is the length of the finite set {k, f(k), f(f(k)), ..., 1} in the Collatz (or 3x + 1) problem, with the property that h(k) = h(k+2n), h(k+1) = h(k+2n-1), ..., h(k+n-1) = h(k+n+1). A268486