Base | Representation |
---|---|
bin | 10000010011010001110… |
… | …010001110010110110111 |
3 | 10222002110102211002021011 |
4 | 100103101302032112313 |
5 | 121323143020213421 |
6 | 2214341243333051 |
7 | 143634606152404 |
oct | 20232162162667 |
9 | 3862412732234 |
10 | 1120211101111 |
11 | 3a2095a65443 |
12 | 161130521187 |
13 | 81835125cbb |
14 | 3c30b8212ab |
15 | 1e21501a4e1 |
hex | 104d1c8e5b7 |
1120211101111 has 2 divisors, whose sum is σ = 1120211101112. Its totient is φ = 1120211101110.
The previous prime is 1120211101103. The next prime is 1120211101123. The reversal of 1120211101111 is 1111011120211.
It is a weak prime.
It is an emirp because it is prime and its reverse (1111011120211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1120211101111 - 23 = 1120211101103 is a prime.
It is a super-2 number, since 2×11202111011112 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1120211101091 and 1120211101100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1120211101181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560105550555 + 560105550556.
It is an arithmetic number, because the mean of its divisors is an integer number (560105550556).
Almost surely, 21120211101111 is an apocalyptic number.
1120211101111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120211101111 is an equidigital number, since it uses as much as digits as its factorization.
1120211101111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 1120211101111 its reverse (1111011120211), we get a palindrome (2231222221322).
The spelling of 1120211101111 in words is "one trillion, one hundred twenty billion, two hundred eleven million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •