Base | Representation |
---|---|
bin | 10111010010011010… |
… | …100111110100101100 |
3 | 2101112122101011122011 |
4 | 113102122213310230 |
5 | 402202241440300 |
6 | 15253120331004 |
7 | 1543435153066 |
oct | 272232476454 |
9 | 71478334564 |
10 | 25005030700 |
11 | a671762731 |
12 | 4a1a173a64 |
13 | 24865a8270 |
14 | 12d2cd6736 |
15 | 9b5367eba |
hex | 5d26a7d2c |
25005030700 has 72 divisors (see below), whose sum is σ = 58468910528. Its totient is φ = 9227243520.
The previous prime is 25005030619. The next prime is 25005030709. The reversal of 25005030700 is 703050052.
It is not an unprimeable number, because it can be changed into a prime (25005030709) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2742349 + ... + 2751451.
Almost surely, 225005030700 is an apocalyptic number.
25005030700 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 25005030700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29234455264).
25005030700 is an abundant number, since it is smaller than the sum of its proper divisors (33463879828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25005030700 is a wasteful number, since it uses less digits than its factorization.
25005030700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11243 (or 11236 counting only the distinct ones).
The product of its (nonzero) digits is 1050, while the sum is 22.
Adding to 25005030700 its reverse (703050052), we get a palindrome (25708080752).
The spelling of 25005030700 in words is "twenty-five billion, five million, thirty thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •