Base | Representation |
---|---|
bin | 1001001100100010011100… |
… | …1110000011100111101101 |
3 | 1022210121021202000220122021 |
4 | 2103020213032003213231 |
5 | 2311124322304323203 |
6 | 33300533452150141 |
7 | 2062332164355661 |
oct | 223104716034755 |
9 | 38717252026567 |
10 | 10111011011053 |
11 | 3249068138757 |
12 | 11736b9168351 |
13 | 584605c49404 |
14 | 26d5386c88a1 |
15 | 128025b945bd |
hex | 932273839ed |
10111011011053 has 2 divisors, whose sum is σ = 10111011011054. Its totient is φ = 10111011011052.
The previous prime is 10111011010973. The next prime is 10111011011119. The reversal of 10111011011053 is 35011011011101.
10111011011053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7831025769609 + 2279985241444 = 2798397^2 + 1509962^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10111011011053 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10111051011053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055505505526 + 5055505505527.
It is an arithmetic number, because the mean of its divisors is an integer number (5055505505527).
Almost surely, 210111011011053 is an apocalyptic number.
It is an amenable number.
10111011011053 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111011011053 is an equidigital number, since it uses as much as digits as its factorization.
10111011011053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15, while the sum is 16.
Adding to 10111011011053 its reverse (35011011011101), we get a palindrome (45122022022154).
The spelling of 10111011011053 in words is "ten trillion, one hundred eleven billion, eleven million, eleven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •