Base | Representation |
---|---|
bin | 1010010111111… |
… | …10010101101000 |
3 | 20001202022212011 |
4 | 11023332111220 |
5 | 134234300000 |
6 | 12345125304 |
7 | 2104462126 |
oct | 513762550 |
9 | 201668764 |
10 | 87025000 |
11 | 4513a197 |
12 | 25189834 |
13 | 1504caaa |
14 | b7b4916 |
15 | 79902ba |
hex | 52fe568 |
87025000 has 72 divisors (see below), whose sum is σ = 207467190. Its totient is φ = 34220000.
The previous prime is 87024961. The next prime is 87025007. The reversal of 87025000 is 52078.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 3 ways, for example, as 125316 + 86899684 = 354^2 + 9322^2 .
It is not an unprimeable number, because it can be changed into a prime (87025007) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 1474971 + ... + 1475029.
Almost surely, 287025000 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 87025000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (103733595).
87025000 is an abundant number, since it is smaller than the sum of its proper divisors (120442190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
87025000 is an frugal number, since it uses more digits than its factorization.
87025000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149 (or 66 counting only the distinct ones).
The product of its (nonzero) digits is 560, while the sum is 22.
The square root of 87025000 is about 9328.7190974967. The cubic root of 87025000 is about 443.1472010895.
Adding to 87025000 its reverse (52078), we get a palindrome (87077078).
The spelling of 87025000 in words is "eighty-seven million, twenty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •