Base | Representation |
---|---|
bin | 100100011010110111110… |
… | …1101100000011010010111 |
3 | 122201112002200020000110001 |
4 | 1020311233231200122113 |
5 | 1124002241320200210 |
6 | 14351300002312131 |
7 | 1024431142224214 |
oct | 110655755403227 |
9 | 18645080200401 |
10 | 5005511100055 |
11 | 165a909582604 |
12 | 68a127658647 |
13 | 2a402ca9340b |
14 | 1343a768cb0b |
15 | 8a31148503a |
hex | 48d6fb60697 |
5005511100055 has 32 divisors (see below), whose sum is σ = 6508227585024. Its totient is φ = 3680993573376.
The previous prime is 5005511100043. The next prime is 5005511100061. The reversal of 5005511100055 is 5500011155005.
It is not a de Polignac number, because 5005511100055 - 221 = 5005509002903 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5005511099996 and 5005511100032.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 91811934 + ... + 91866436.
It is an arithmetic number, because the mean of its divisors is an integer number (203382112032).
Almost surely, 25005511100055 is an apocalyptic number.
5005511100055 is a deficient number, since it is larger than the sum of its proper divisors (1502716484969).
5005511100055 is a wasteful number, since it uses less digits than its factorization.
5005511100055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79695.
The product of its (nonzero) digits is 3125, while the sum is 28.
The spelling of 5005511100055 in words is "five trillion, five billion, five hundred eleven million, one hundred thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •