Base | Representation |
---|---|
bin | 10001011110100111110… |
… | …011001111001010011111 |
3 | 11020211021111102221112111 |
4 | 101132213303033022133 |
5 | 124134333420231421 |
6 | 2315441031214451 |
7 | 152530436625544 |
oct | 21364763171237 |
9 | 4224244387474 |
10 | 1201111102111 |
11 | 42342a9a45a8 |
12 | 174949817427 |
13 | 89358854a8b |
14 | 421c3d16bcb |
15 | 2139c515ee1 |
hex | 117a7ccf29f |
1201111102111 has 2 divisors, whose sum is σ = 1201111102112. Its totient is φ = 1201111102110.
The previous prime is 1201111102099. The next prime is 1201111102133. The reversal of 1201111102111 is 1112011111021.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1201111102111 - 215 = 1201111069343 is a prime.
It is a super-2 number, since 2×12011111021112 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1201111102091 and 1201111102100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1201111102141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 600555551055 + 600555551056.
It is an arithmetic number, because the mean of its divisors is an integer number (600555551056).
Almost surely, 21201111102111 is an apocalyptic number.
1201111102111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1201111102111 is an equidigital number, since it uses as much as digits as its factorization.
1201111102111 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 1201111102111 its reverse (1112011111021), we get a palindrome (2313122213132).
It can be divided in two parts, 12011111021 and 11, that multiplied together give a palindrome (132122221231).
The spelling of 1201111102111 in words is "one trillion, two hundred one billion, one hundred eleven million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •