Properties of the Number -57961

Fifty-Seven Thousand Nine Hundred Sixty-One

Basics

Value: -57962 → -57961 → -57960

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 149 × 389

Divisors: 1, 149, 389, 57961

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1110001001101001

Octal: -161151

Duodecimal: -29661

Hexadecimal: -e269

Square: 3359477521

Square Root: 240.75090861718465

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 k such that A361338(k) = 10. A361349

E.g.f.: exp(x + x⁴/4). A118934

G.f.: ∑_k>=1 (k³ * x^k² / ∏_j=1..k (1 - x^j)). A333151

E.g.f.: A(x) = exp( ∑_n>=0 x^4ⁿ/4^(4ⁿ-1/3) ). A118935

Centered truncated octahedral numbers: the number of integer triples (x,y,z) such that max(|x|,|y|,|z|) <= 2n and |x|+|y|+|z| <= 3n. A371515

a(n) = ceiling((n + 7/10)³). A34133

a(n) = number of strings of length n that can be obtained by starting with abc and repeatedly doubling any substring of length >= 2 in place. A135156

a(n) equals the sum of path counts in the (right-aligned Ferrers plots of) the partitions of n. A180684

a(n) = n³ + 2·n² + 5·n + 11. A271779

Number of (not necessarily maximal) cliques in the n-transposition graph. A308606