Base | Representation |
---|---|
bin | 10111010011010100… |
… | …101011011001001000 |
3 | 2101120201000101010210 |
4 | 113103110223121020 |
5 | 402220140442142 |
6 | 15254422441120 |
7 | 1544011420215 |
oct | 272324533110 |
9 | 71521011123 |
10 | 25020249672 |
11 | a67a3079a0 |
12 | 4a232931a0 |
13 | 24897a6482 |
14 | 12d4d38b0c |
15 | 9b687249c |
hex | 5d352b648 |
25020249672 has 64 divisors (see below), whose sum is σ = 69901392960. Its totient is φ = 7396966400.
The previous prime is 25020249671. The next prime is 25020249677. The reversal of 25020249672 is 27694202052.
It is a super-2 number, since 2×250202496722 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 25020249672.
It is not an unprimeable number, because it can be changed into a prime (25020249671) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 1144953 + ... + 1166600.
It is an arithmetic number, because the mean of its divisors is an integer number (1092209265).
Almost surely, 225020249672 is an apocalyptic number.
25020249672 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
25020249672 is an abundant number, since it is smaller than the sum of its proper divisors (44881143288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25020249672 is a wasteful number, since it uses less digits than its factorization.
25020249672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2311614 (or 2311610 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 39.
The spelling of 25020249672 in words is "twenty-five billion, twenty million, two hundred forty-nine thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •