Properties of the Number -57675

Fifty-Seven Thousand Six Hundred Seventy-Five

Basics

Value: -57676 → -57675 → -57674

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 30

Digital Root: 3

Palindrome: Yes

Factorization: 3 × 5 ² × 769

Divisors: 1, 3, 5, 15, 25, 75, 769, 2307, 3845, 11535

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1110000101001011

Octal: -160513

Duodecimal: -29463

Hexadecimal: -e14b

Square: 3326405625

Square Root: 240.15619917045655

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

Positive integers k such that k!!! - 1 = A007661(k) - 1 is prime. A84438

Palindromic in bases 4 and 10. A29961

Number A(n,k) of inequivalent n X n matrices with entries from [k], where equivalence means permutations of rows or columns; square array A(n,k), n>=0, k>=0, read by antidiagonals. A246106

Number of n X n matrices over GF(5) under row and column permutations. A52272

Number of 3 X 3 matrices with entries mod n, up to row and column permutation. A58001

Numbers that are the sum of ten fifth powers in three or more ways. A345635

Numbers that are the sum of ten fifth powers in exactly three ways. A346348

Triangle a(n,m)=number of m-element antichains on a labeled n-set; number of monotone n-variable Boolean functions with m mincuts (lower units), m=0..binomial(n,floor(n,2)). A59119

Square array T(n,k): row n lists the number of inequivalent matrices over Z/nZ, modulo permutations of rows and columns, of size r X c, 1 <= r <= c, c >= 1. A353585

a(n) is the smallest number k > 1 such that, in the interval 1..k, there are as many integers that have exactly 2n divisors as there are primes (or -1 if no such number exists). A356136