Base | Representation |
---|---|
bin | 1001110011010110… |
… | …01011011001101100 |
3 | 111120202111010220011 |
4 | 10321223023121230 |
5 | 41234210300000 |
6 | 2230111303004 |
7 | 244261153462 |
oct | 47153133154 |
9 | 14522433804 |
10 | 5262587500 |
11 | 2260658975 |
12 | 102a51aa64 |
13 | 65b38a801 |
14 | 37ccd6832 |
15 | 20c0252ba |
hex | 139acb66c |
5262587500 has 72 divisors (see below), whose sum is σ = 11584696032. Its totient is φ = 2091600000.
The previous prime is 5262587483. The next prime is 5262587501. The reversal of 5262587500 is 57852625.
It is not an unprimeable number, because it can be changed into a prime (5262587501) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2086240 + ... + 2088760.
It is an arithmetic number, because the mean of its divisors is an integer number (160898556).
Almost surely, 25262587500 is an apocalyptic number.
5262587500 is a gapful number since it is divisible by the number (50) 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 5262587500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5792348016).
5262587500 is an abundant number, since it is smaller than the sum of its proper divisors (6322108532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5262587500 is a wasteful number, since it uses less digits than its factorization.
5262587500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2717 (or 2695 counting only the distinct ones).
The product of its (nonzero) digits is 168000, while the sum is 40.
The square root of 5262587500 is about 72543.6937300549. The cubic root of 5262587500 is about 1739.4012450792.
The spelling of 5262587500 in words is "five billion, two hundred sixty-two million, five hundred eighty-seven thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •