Base | Representation |
---|---|
bin | 100100011000100010101… |
… | …0110110110010011100111 |
3 | 122201001011211101201201022 |
4 | 1020301011112312103213 |
5 | 1123412013410100210 |
6 | 14345111152121355 |
7 | 1024163121603041 |
oct | 110610526662347 |
9 | 18631154351638 |
10 | 5000505550055 |
11 | 1658780024824 |
12 | 68916b23625b |
13 | 2a3712a40602 |
14 | 134050984a91 |
15 | 8a11bcd4155 |
hex | 48c455b64e7 |
5000505550055 has 16 divisors (see below), whose sum is σ = 6261562713024. Its totient is φ = 3826437077760.
The previous prime is 5000505550037. The next prime is 5000505550069. The reversal of 5000505550055 is 5500555050005.
It is not a de Polignac number, because 5000505550055 - 238 = 4725627643111 is a prime.
It is a super-2 number, since 2×50005055500552 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5000505549997 and 5000505550024.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22859057 + ... + 23076773.
It is an arithmetic number, because the mean of its divisors is an integer number (391347669564).
Almost surely, 25000505550055 is an apocalyptic number.
5000505550055 is a deficient number, since it is larger than the sum of its proper divisors (1261057162969).
5000505550055 is a wasteful number, since it uses less digits than its factorization.
5000505550055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 417466.
The product of its (nonzero) digits is 78125, while the sum is 35.
The spelling of 5000505550055 in words is "five trillion, five hundred five million, five hundred fifty thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •