Base | Representation |
---|---|
bin | 100100011000100010101… |
… | …0100111101100100110010 |
3 | 122201001011210110121100212 |
4 | 1020301011110331210302 |
5 | 1123412013243234123 |
6 | 14345111133344122 |
7 | 1024163114443226 |
oct | 110610524754462 |
9 | 18631153417325 |
10 | 5000505055538 |
11 | 165877a817233 |
12 | 68916b038042 |
13 | 2a37128c94b5 |
14 | 134050896786 |
15 | 8a11bc37878 |
hex | 48c4553d932 |
5000505055538 has 16 divisors (see below), whose sum is σ = 7659412959840. Its totient is φ = 2447825282496.
The previous prime is 5000505055517. The next prime is 5000505055543. The reversal of 5000505055538 is 8355505050005.
It is a super-2 number, since 2×50005050555382 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5000505055495 and 5000505055504.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 114448103 + ... + 114491786.
It is an arithmetic number, because the mean of its divisors is an integer number (478713309990).
Almost surely, 25000505055538 is an apocalyptic number.
5000505055538 is a deficient number, since it is larger than the sum of its proper divisors (2658907904302).
5000505055538 is a wasteful number, since it uses less digits than its factorization.
5000505055538 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228940121.
The product of its (nonzero) digits is 375000, while the sum is 41.
The spelling of 5000505055538 in words is "five trillion, five hundred five million, fifty-five thousand, five hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •