Base | Representation |
---|---|
bin | 1001001100100010110111… |
… | …0010000011110000101111 |
3 | 1022210121120102012121220020 |
4 | 2103020231302003300233 |
5 | 2311130034001041421 |
6 | 33300552424053223 |
7 | 2062335002251215 |
oct | 223105562036057 |
9 | 38717512177806 |
10 | 10111121112111 |
11 | 32491142a9268 |
12 | 117372a004213 |
13 | 5846229b8776 |
14 | 26d549188cb5 |
15 | 128030691dc6 |
hex | 9322dc83c2f |
10111121112111 has 8 divisors (see below), whose sum is σ = 13487681834880. Its totient is φ = 6737653898712.
The previous prime is 10111121112101. The next prime is 10111121112179. The reversal of 10111121112111 is 11121112111101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10111121112111 - 26 = 10111121112047 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111121112101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 773369715 + ... + 773382788.
It is an arithmetic number, because the mean of its divisors is an integer number (1685960229360).
Almost surely, 210111121112111 is an apocalyptic number.
10111121112111 is a deficient number, since it is larger than the sum of its proper divisors (3376560722769).
10111121112111 is a wasteful number, since it uses less digits than its factorization.
10111121112111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1546754685.
The product of its (nonzero) digits is 4, while the sum is 15.
Adding to 10111121112111 its reverse (11121112111101), we get a palindrome (21232233223212).
It can be divided in two parts, 101 and 11121112111, that multiplied together give a palindrome (1123232323211).
The spelling of 10111121112111 in words is "ten trillion, one hundred eleven billion, one hundred twenty-one million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •