Base | Representation |
---|---|
bin | 10000010101000010011… |
… | …111011110000011111111 |
3 | 10222021100012220012202211 |
4 | 100111002133132003333 |
5 | 121341031103310421 |
6 | 2215253032201251 |
7 | 144032506466545 |
oct | 20250237360377 |
9 | 3867305805684 |
10 | 1122102010111 |
11 | 3a2976371355 |
12 | 161579839227 |
13 | 81a76ac5974 |
14 | 3c44a9ddd95 |
15 | 1e2c602e9e1 |
hex | 105427de0ff |
1122102010111 has 2 divisors, whose sum is σ = 1122102010112. Its totient is φ = 1122102010110.
The previous prime is 1122102010103. The next prime is 1122102010129. The reversal of 1122102010111 is 1110102012211.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (1110102012211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1122102010111 - 23 = 1122102010103 is a prime.
It is a super-2 number, since 2×11221020101112 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1122102010091 and 1122102010100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1122102017111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561051005055 + 561051005056.
It is an arithmetic number, because the mean of its divisors is an integer number (561051005056).
Almost surely, 21122102010111 is an apocalyptic number.
1122102010111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1122102010111 is an equidigital number, since it uses as much as digits as its factorization.
1122102010111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1122102010111 its reverse (1110102012211), we get a palindrome (2232204022322).
The spelling of 1122102010111 in words is "one trillion, one hundred twenty-two billion, one hundred two million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •