Base | Representation |
---|---|
bin | 10000010101000011101… |
… | …100100100101000011111 |
3 | 10222021101121221002102102 |
4 | 100111003230210220133 |
5 | 121341101242101421 |
6 | 2215255033315315 |
7 | 144033143340632 |
oct | 20250354445037 |
9 | 3867347832372 |
10 | 1122122222111 |
11 | 3a2986816990 |
12 | 161584565b3b |
13 | 81a7b051727 |
14 | 3c44d581c19 |
15 | 1e2c7bc360b |
hex | 10543b24a1f |
1122122222111 has 16 divisors (see below), whose sum is σ = 1236332891808. Its totient is φ = 1009946112000.
The previous prime is 1122122222071. The next prime is 1122122222131. The reversal of 1122122222111 is 1112222212211.
It is a cyclic number.
It is not a de Polignac number, because 1122122222111 - 218 = 1122121959967 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122122222131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28769855 + ... + 28808831.
It is an arithmetic number, because the mean of its divisors is an integer number (77270805738).
Almost surely, 21122122222111 is an apocalyptic number.
1122122222111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1122122222111 is a deficient number, since it is larger than the sum of its proper divisors (114210669697).
1122122222111 is a wasteful number, since it uses less digits than its factorization.
1122122222111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65002.
The product of its digits is 128, while the sum is 20.
Adding to 1122122222111 its reverse (1112222212211), we get a palindrome (2234344434322).
It can be divided in two parts, 11 and 22122222111, that added together give a palindrome (22122222122).
The spelling of 1122122222111 in words is "one trillion, one hundred twenty-two billion, one hundred twenty-two million, two hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •