Properties of the Number 57960

Fifty-Seven Thousand Nine Hundred Sixty

Basics

Value: 57959 → 57960 → 57961

Parity: even

Prime: No

Previous Prime: 57947

Next Prime: 57973

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ³ × 3 ² × 5 × 7 × 23

Divisors: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1110001001101000

Octal: 161150

Duodecimal: 29660

Hexadecimal: e268

Square: 3359361600

Square Root: 240.74883177286657

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

T(n,k) = number of length-n 0..k arrays connected end-around, with no sequence of L<n elements immediately followed by itself (periodic "squarefree"). A215228

Numbers expressible as (a²-1)(b²-1) in at least 2 distinct ways (b>=a>1). A63067

Numbers c(n) whose square are equal to the sum of an odd number M of consecutive cubed integers b³ + (b+1)³ + ... + (b+M-1)³ = c(n)², starting at b(n) (A253679). A253680

Numbers n such that {largest m such that 1, 2, ..., m divide n} is different from {largest m such that m! divides n²}. A232099

Lesser of semi-unitary amicable numbers pair: numbers (m, n) such that susigma(m) = susigma(n) = m + n, where susigma(n) is the sum of the semi-unitary divisors of n (A322485). A322541

Numbers with prime factorization p·q*r·s²*t³ (where p, q, r, s, t are distinct primes). A190111

E.g.f. satisfies A(x) = 1 + x·A(x)*exp(x³*A(x)). A365285

Index values for new maxima in sequence A007365. A65932

Smallest number greater than a(n-1) that, when adding the reciprocals of all the terms up to it, the sum is <= 3. A140335

'Greedy' sequence formed by summing unit fractions until the sum is 1, and repeating using up the 'left over' fractions. A157248