Base | Representation |
---|---|
bin | 10111100100000111… |
… | …011111010100001000 |
3 | 2102022100012000210022 |
4 | 113210013133110020 |
5 | 403304303130000 |
6 | 15342405440012 |
7 | 1554002331266 |
oct | 274407372410 |
9 | 72270160708 |
10 | 25302005000 |
11 | a80435a938 |
12 | 4aa1710008 |
13 | 2502c86abc |
14 | 132051d436 |
15 | 9d147a585 |
hex | 5e41df508 |
25302005000 has 40 divisors (see below), whose sum is σ = 59282609430. Its totient is φ = 10120800000.
The previous prime is 25302004969. The next prime is 25302005011. The reversal of 25302005000 is 50020352.
It can be written as a sum of positive squares in 5 ways, for example, as 730188484 + 24571816516 = 27022^2 + 156754^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a self number, because there is not a number n which added to its sum of digits gives 25302005000.
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 9 ways as a sum of consecutive naturals, for example, 2525201 + ... + 2535200.
Almost surely, 225302005000 is an apocalyptic number.
25302005000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
25302005000 is an abundant number, since it is smaller than the sum of its proper divisors (33980604430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25302005000 is an equidigital number, since it uses as much as digits as its factorization.
25302005000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5060427 (or 5060408 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 17.
Adding to 25302005000 its reverse (50020352), we get a palindrome (25352025352).
The spelling of 25302005000 in words is "twenty-five billion, three hundred two million, five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •