Base | Representation |
---|---|
bin | 100100011010101001010… |
… | …1111011001001100111110 |
3 | 122201110211210122101201201 |
4 | 1020311102233121030332 |
5 | 1124000242403234200 |
6 | 14351135440530114 |
7 | 1024413121012642 |
oct | 110652257311476 |
9 | 18643753571651 |
10 | 5005025055550 |
11 | 165a68a188133 |
12 | 68a01092093a |
13 | 2a3c83186410 |
14 | 13435cccac22 |
15 | 8a2d3976c6a |
hex | 48d52bd933e |
5005025055550 has 48 divisors (see below), whose sum is σ = 10027216154592. Its totient is φ = 1847683728000.
The previous prime is 5005025055521. The next prime is 5005025055551. The reversal of 5005025055550 is 555505205005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5005025055551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3030327 + ... + 4380973.
It is an arithmetic number, because the mean of its divisors is an integer number (208900336554).
Almost surely, 25005025055550 is an apocalyptic number.
5005025055550 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5005025055550 is an abundant number, since it is smaller than the sum of its proper divisors (5022191099042).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5005025055550 is a wasteful number, since it uses less digits than its factorization.
5005025055550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1356373 (or 1356368 counting only the distinct ones).
The product of its (nonzero) digits is 156250, while the sum is 37.
The spelling of 5005025055550 in words is "five trillion, five billion, twenty-five million, fifty-five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •