Base | Representation |
---|---|
bin | 10111010010000111… |
… | …100001101110101000 |
3 | 2101112021221212002212 |
4 | 113102013201232220 |
5 | 402200001300000 |
6 | 15252421144252 |
7 | 1543344464156 |
oct | 272207415650 |
9 | 71467855085 |
10 | 25000025000 |
11 | a669953895 |
12 | 4a1855b088 |
13 | 2485544a02 |
14 | 12d23923d6 |
15 | 9b4bc9c35 |
hex | 5d21e1ba8 |
25000025000 has 96 divisors (see below), whose sum is σ = 59176134360. Its totient is φ = 9900000000.
The previous prime is 25000024997. The next prime is 25000025023. The reversal of 25000025000 is 52000052.
It can be written as a sum of positive squares in 12 ways, for example, as 653415844 + 24346609156 = 25562^2 + 156034^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2520050 + ... + 2529950.
Almost surely, 225000025000 is an apocalyptic number.
25000025000 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 25000025000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29588067180).
25000025000 is an abundant number, since it is smaller than the sum of its proper divisors (34176109360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25000025000 is an equidigital number, since it uses as much as digits as its factorization.
25000025000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10033 (or 10009 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 14.
Adding to 25000025000 its reverse (52000052), we get a palindrome (25052025052).
The spelling of 25000025000 in words is "twenty-five billion, twenty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •