Base | Representation |
---|---|
bin | 10111011110000111… |
… | …010101111000000000 |
3 | 2102001022200211200002 |
4 | 113132013111320000 |
5 | 403103013144130 |
6 | 15324411215132 |
7 | 1551340353464 |
oct | 273607257000 |
9 | 72038624602 |
10 | 25201303040 |
11 | a762529a81 |
12 | 4a73a474a8 |
13 | 24b8158944 |
14 | 1310dc84a4 |
15 | 9c76d7b45 |
hex | 5de1d5e00 |
25201303040 has 40 divisors (see below), whose sum is σ = 60424067880. Its totient is φ = 10080520192.
The previous prime is 25201303037. The next prime is 25201303111. The reversal of 25201303040 is 4030310252.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (40).
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 4919570 + ... + 4924689.
It is an arithmetic number, because the mean of its divisors is an integer number (1510601697).
Almost surely, 225201303040 is an apocalyptic number.
25201303040 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
25201303040 is an abundant number, since it is smaller than the sum of its proper divisors (35222764840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25201303040 is an frugal number, since it uses more digits than its factorization.
25201303040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9844282 (or 9844266 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 20.
Adding to 25201303040 its reverse (4030310252), we get a palindrome (29231613292).
The spelling of 25201303040 in words is "twenty-five billion, two hundred one million, three hundred three thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •