Base | Representation |
---|---|
bin | 11001001111100011101110… |
… | …001101001110010111001001 |
3 | 112120002102211100220120001200 |
4 | 121033203232031032113021 |
5 | 104022424044121023423 |
6 | 1032042005443534413 |
7 | 32245644543050145 |
oct | 3117435615162711 |
9 | 476072740816050 |
10 | 111020311111113 |
11 | 324134a4368528 |
12 | 1055059168a409 |
13 | 49c422a532c31 |
14 | 1d5b5a9ad6225 |
15 | cc7d5e19ad43 |
hex | 64f8ee34e5c9 |
111020311111113 has 24 divisors (see below), whose sum is σ = 170009597811456. Its totient is φ = 69690169130400.
The previous prime is 111020311111093. The next prime is 111020311111117. The reversal of 111020311111113 is 311111113020111.
It is a happy number.
111020311111113 is a `hidden beast` number, since 1 + 110 + 20 + 311 + 111 + 113 = 666.
It is not a de Polignac number, because 111020311111113 - 25 = 111020311111081 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (111020311111117) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5377317543 + ... + 5377338188.
It is an arithmetic number, because the mean of its divisors is an integer number (7083733242144).
Almost surely, 2111020311111113 is an apocalyptic number.
It is an amenable number.
111020311111113 is a deficient number, since it is larger than the sum of its proper divisors (58989286700343).
111020311111113 is a wasteful number, since it uses less digits than its factorization.
111020311111113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10754655805 (or 10754655802 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 18.
Adding to 111020311111113 its reverse (311111113020111), we get a palindrome (422131424131224).
The spelling of 111020311111113 in words is "one hundred eleven trillion, twenty billion, three hundred eleven million, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •