Properties of the Number -390625

Three Hundred Ninety Thousand Six Hundred Twenty-Five

Basics

Value: -390626 → -390625 → -390624

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 5 ⁸

Divisors: 1, 5, 25, 125, 625, 3125, 15625, 78125, 390625

Polygonal

Triangular: No

Square: Yes

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1011111010111100001

Octal: -1372741

Duodecimal: -16A081

Hexadecimal: -5f5e1

Square: 152587890625

Square Root: 625

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: Yes

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

Fourth powers: a(n) = n⁴. A583

Powers of 5: a(n) = 5ⁿ. A351

Eighth powers: a(n) = n⁸. A1016

The powertrain or power train map: Powertrain(n): if abcd... is the decimal expansion of a number n, then the powertrain of n is the number n' = a^b*c^d* ..., which ends in an exponent or a base according as the number of digits is even or odd. a(0) = 0 by convention. A133500

Powers of 25. A9969

Least hypotenuse of n distinct Pythagorean triangles. A6339

Dispersion of A008587 (5,10,15,20,25,30,...), by antidiagonals. A191702

a(n) = prime(n)⁸. A179645

Triangle read by rows: coefficients T(n,k) of a binomial decomposition of 0^n-1 as Sum(k=0..n)T(n,k)*binomial(n,k). A244128

Hypotenuses for which there exist exactly 8 distinct integer triangles. A290499