Properties of the Number -38557

Thirty-Eight Thousand Five Hundred Fifty-Seven

Basics

Value: -38558 → -38557 → -38556

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 38557

Divisors: 1, 38557

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1001011010011101

Octal: -113235

Duodecimal: -1A391

Hexadecimal: -969d

Square: 1486642249

Square Root: 196.3593644316461

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

If a,b are prime numbers satisfying the Diophantine equation a³+b³=c², then a is -1 mod 12 and b is 1 mod 12, or vice versa. Choose 'b' to be 1 mod 12. This is the sequence of 'b' values, sorted by the magnitude of c. A99807

Primes 6k + 1 at the end of first-occurrence gaps in A330853. A330855

There appear to be at least n primes in the range (x-sqrt(x), x] for all x >= a(n). A189026

Primes 6k + 1 at the end of the maximal gaps in A268925. A268927

Numbers such that A279966(n) = 0. A278436

Numerators of continued fraction convergents to sqrt(727). A42400

Values of p in A145767. A145797

Numbers k such that the continued fraction for sqrt(k) has period 93. A20432

Primes p such that number of primes produced according to rules stipulated in Honaker's A048853 is 2. A50664

a(n) is the smallest prime m such that prod(m) = n·length(m)*sum(m) where prod(m) is the product of the digits of m, length(m) is the number of digits of m, sum(m) is the sum of the digits of m; or 0 if no such m exists. A64023