Properties of the Number -62499

Sixty-Two Thousand Four Hundred Ninety-Nine

Basics

Value: -62500 → -62499 → -62498

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 83 × 251

Divisors: 1, 3, 83, 249, 251, 753, 20833, 62499

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1111010000100011

Octal: -172043

Duodecimal: -30203

Hexadecimal: -f423

Square: 3906125001

Square Root: 249.99799999199993

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 φ(k) | sigma₁₀(k). A15768

Numbers of the form i·5^j-1 (i=1..4, j >= 0). A181287

Smallest k for which k, 2k, ... nk all contain the digit 4. A39935

Numbers which contain only the digit 4 in their base-5 representation, with at most one exception. If the exception is the most-significant digit, it must be the digit 1, 2, or 3, otherwise the exception must be the digit 3. A188531

Product of two consecutive odd numbers k, k+2 such that (k*(k+2))+-2 are primes. A174383

Number of length n word structures with all distinct runs using exactly 3 symbols. A351643

Least number k such that k²-1 is the sum of two nonzero squares in exactly n ways. A274567

a(n) = 4·5ⁿ-1. A198763

G.f. satisfies: A(x)³ = x + A(x·A(x)³)². A241001

Variation on Fermat's Diophantine m-tuple: 1 + the GCD of any two distinct terms is a square. A274697