Base | Representation |
---|---|
bin | 100101000111011000101… |
… | …0100011101001100100111 |
3 | 200001122211111200122200210 |
4 | 1022032301110131030213 |
5 | 1132034023341010210 |
6 | 14503225152110503 |
7 | 1034354020006056 |
oct | 112166124351447 |
9 | 20048744618623 |
10 | 5101101110055 |
11 | 1697401655975 |
12 | 6a4764535433 |
13 | 2b0054a52a02 |
14 | 138c74b5439d |
15 | 8ca58460e20 |
hex | 4a3b151d327 |
5101101110055 has 32 divisors (see below), whose sum is σ = 8525672133120. Its totient is φ = 2599535227520.
The previous prime is 5101101110011. The next prime is 5101101110113. The reversal of 5101101110055 is 5500111011015.
5101101110055 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5101101110055 - 211 = 5101101108007 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7531785 + ... + 8181074.
It is an arithmetic number, because the mean of its divisors is an integer number (266427254160).
Almost surely, 25101101110055 is an apocalyptic number.
5101101110055 is a deficient number, since it is larger than the sum of its proper divisors (3424571023065).
5101101110055 is a wasteful number, since it uses less digits than its factorization.
5101101110055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15713831.
The product of its (nonzero) digits is 125, while the sum is 21.
The spelling of 5101101110055 in words is "five trillion, one hundred one billion, one hundred one million, one hundred ten thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •