Base | Representation |
---|---|
bin | 10000001010101101011… |
… | …111001101001010010111 |
3 | 10221012201100110112202011 |
4 | 100022231133031022113 |
5 | 121200323110413421 |
6 | 2210220355125051 |
7 | 143160626615101 |
oct | 20125537151227 |
9 | 3835640415664 |
10 | 1111012201111 |
11 | 3991a547274a |
12 | 15b3a38a3787 |
13 | 809ca3b52c7 |
14 | 3bab7c32571 |
15 | 1dd776504e1 |
hex | 102ad7cd297 |
1111012201111 has 2 divisors, whose sum is σ = 1111012201112. Its totient is φ = 1111012201110.
The previous prime is 1111012201099. The next prime is 1111012201183. The reversal of 1111012201111 is 1111022101111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1111012201111 - 27 = 1111012200983 is a prime.
It is a super-2 number, since 2×11110122011112 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1111012201091 and 1111012201100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1111012901111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555506100555 + 555506100556.
It is an arithmetic number, because the mean of its divisors is an integer number (555506100556).
Almost surely, 21111012201111 is an apocalyptic number.
1111012201111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111012201111 is an equidigital number, since it uses as much as digits as its factorization.
1111012201111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 1111012201111 its reverse (1111022101111), we get a palindrome (2222034302222).
The spelling of 1111012201111 in words is "one trillion, one hundred eleven billion, twelve million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •