Base | Representation |
---|---|
bin | 1111101001010… |
… | …1101110101000 |
3 | 11120111002120120 |
4 | 3322111232220 |
5 | 113300000000 |
6 | 10302323240 |
7 | 1424542350 |
oct | 372255650 |
9 | 146432516 |
10 | 65625000 |
11 | 34053041 |
12 | 19b89520 |
13 | 1079937c |
14 | 8a03b60 |
15 | 5b646a0 |
hex | 3e95ba8 |
65625000 has 144 divisors (see below), whose sum is σ = 234374880. Its totient is φ = 15000000.
The previous prime is 65624953. The next prime is 65625017. The reversal of 65625000 is 52656.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a zygodrome in base 5.
It is a Saint-Exupery number, since it is equal to the product of the sides of a Pythagorean triangle: 625 × 175 × 600.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 9374997 + ... + 9375003.
Almost surely, 265625000 is an apocalyptic number.
65625000 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 65625000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (117187440).
65625000 is an abundant number, since it is smaller than the sum of its proper divisors (168749880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65625000 is an frugal number, since it uses more digits than its factorization.
65625000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56 (or 17 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 24.
The square root of 65625000 is about 8100.9258730098. The cubic root of 65625000 is about 403.3571615061.
Adding to 65625000 its reverse (52656), we get a palindrome (65677656).
The spelling of 65625000 in words is "sixty-five million, six hundred twenty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •