Base | Representation |
---|---|
bin | 110110100110… |
… | …0100001101000 |
3 | 1222212022010012 |
4 | 1231030201220 |
5 | 24312000000 |
6 | 2501311052 |
7 | 465210545 |
oct | 155144150 |
9 | 58768105 |
10 | 28625000 |
11 | 15181428 |
12 | 9705488 |
13 | 5c13191 |
14 | 3b31bcc |
15 | 27a6735 |
hex | 1b4c868 |
28625000 has 56 divisors (see below), whose sum is σ = 67381950. Its totient is φ = 11400000.
The previous prime is 28624993. The next prime is 28625017. The reversal of 28625000 is 52682.
It is a happy number.
It can be written as a sum of positive squares in 7 ways, for example, as 8031556 + 20593444 = 2834^2 + 4538^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 124886 + ... + 125114.
Almost surely, 228625000 is an apocalyptic number.
28625000 is a gapful number since it is divisible by the number (20) 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 28625000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33690975).
28625000 is an abundant number, since it is smaller than the sum of its proper divisors (38756950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28625000 is an frugal number, since it uses more digits than its factorization.
28625000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 265 (or 236 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 23.
The square root of 28625000 is about 5350.2336397582. The cubic root of 28625000 is about 305.9016586318.
Adding to 28625000 its reverse (52682), we get a palindrome (28677682).
The spelling of 28625000 in words is "twenty-eight million, six hundred twenty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •