Base | Representation |
---|---|
bin | 1010011000001… |
… | …00101111000000 |
3 | 20001210122210112 |
4 | 11030010233000 |
5 | 134241114300 |
6 | 12345450452 |
7 | 2104631405 |
oct | 514045700 |
9 | 201718715 |
10 | 87051200 |
11 | 45157945 |
12 | 251a0a28 |
13 | 1505b9b2 |
14 | b7c02ac |
15 | 7997e35 |
hex | 5304bc0 |
87051200 has 84 divisors (see below), whose sum is σ = 219590112. Its totient is φ = 33945600.
The previous prime is 87051199. The next prime is 87051253. The reversal of 87051200 is 215078.
It is a super-2 number, since 2×870512002 = 15155822842880000, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 64937 + ... + 66263.
It is an arithmetic number, because the mean of its divisors is an integer number (2614168).
Almost surely, 287051200 is an apocalyptic number.
87051200 is a gapful number since it is divisible by the number (80) 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 87051200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (109795056).
87051200 is an abundant number, since it is smaller than the sum of its proper divisors (132538912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
87051200 is a wasteful number, since it uses less digits than its factorization.
87051200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1390 (or 1375 counting only the distinct ones).
The product of its (nonzero) digits is 560, while the sum is 23.
The square root of 87051200 is about 9330.1232574924. The cubic root of 87051200 is about 443.1916683564.
Adding to 87051200 its reverse (215078), we get a palindrome (87266278).
The spelling of 87051200 in words is "eighty-seven million, fifty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •