Base | Representation |
---|---|
bin | 11001001111011010001101… |
… | …101001111011011001111110 |
3 | 112120001110110211100222102112 |
4 | 121033122031221323121332 |
5 | 104022242141413423402 |
6 | 1032033200404254022 |
7 | 32245133540143310 |
oct | 3117321551733176 |
9 | 476043424328375 |
10 | 111010101311102 |
11 | 3240a135187684 |
12 | 1054a6023a1312 |
13 | 49c3291239956 |
14 | 1d5acbbb5d7b0 |
15 | cc7962b99e52 |
hex | 64f68da7b67e |
111010101311102 has 16 divisors (see below), whose sum is σ = 190303166607840. Its totient is φ = 47575723757568.
The previous prime is 111010101311093. The next prime is 111010101311167. The reversal of 111010101311102 is 201113101010111.
It is a super-2 number, since 2×1110101013111022 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34257674 + ... + 37357842.
It is an arithmetic number, because the mean of its divisors is an integer number (11893947912990).
Almost surely, 2111010101311102 is an apocalyptic number.
111010101311102 is a deficient number, since it is larger than the sum of its proper divisors (79293065296738).
111010101311102 is a wasteful number, since it uses less digits than its factorization.
111010101311102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5657875.
The product of its (nonzero) digits is 6, while the sum is 14.
Adding to 111010101311102 its reverse (201113101010111), we get a palindrome (312123202321213).
The spelling of 111010101311102 in words is "one hundred eleven trillion, ten billion, one hundred one million, three hundred eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •