Base | Representation |
---|---|
bin | 11001001111011011111111… |
… | …011110110100100011111111 |
3 | 112120001122101220210100000011 |
4 | 121033123333132310203333 |
5 | 104022310044304031421 |
6 | 1032034114103444051 |
7 | 32245232056224502 |
oct | 3117337736644377 |
9 | 476048356710004 |
10 | 111012011002111 |
11 | 3240aa2515180a |
12 | 1054aa55a56627 |
13 | 49c3506a8452b |
14 | 1d5b01d62b139 |
15 | cc7a2566e4e1 |
hex | 64f6ff7b48ff |
111012011002111 has 4 divisors (see below), whose sum is σ = 111014989069032. Its totient is φ = 111009032935192.
The previous prime is 111012011002099. The next prime is 111012011002181. The reversal of 111012011002111 is 111200110210111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 111012011002111 - 223 = 111012002613503 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111012011002091 and 111012011002100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111012011002181) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1488977545 + ... + 1489052098.
It is an arithmetic number, because the mean of its divisors is an integer number (27753747267258).
Almost surely, 2111012011002111 is an apocalyptic number.
111012011002111 is a deficient number, since it is larger than the sum of its proper divisors (2978066921).
111012011002111 is an equidigital number, since it uses as much as digits as its factorization.
111012011002111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2978066920.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 111012011002111 its reverse (111200110210111), we get a palindrome (222212121212222).
The spelling of 111012011002111 in words is "one hundred eleven trillion, twelve billion, eleven million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •