Base | Representation |
---|---|
bin | 11110101110000010101… |
… | …010000101000010110011 |
3 | 21110210220200110120021221 |
4 | 132232002222011002303 |
5 | 234041332334323443 |
6 | 4253442322325511 |
7 | 305342032346233 |
oct | 36560252050263 |
9 | 7423820416257 |
10 | 2111021011123 |
11 | 744308365742 |
12 | 2a11687b9897 |
13 | 1240b7446b6b |
14 | 742614cdcc3 |
15 | 39da4a56eed |
hex | 1eb82a850b3 |
2111021011123 has 2 divisors, whose sum is σ = 2111021011124. Its totient is φ = 2111021011122.
The previous prime is 2111021011109. The next prime is 2111021011181. The reversal of 2111021011123 is 3211101201112.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2111021011123 is a prime.
It is a super-2 number, since 2×21110210111232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2111021011097 and 2111021011106.
It is not a weakly prime, because it can be changed into another prime (2111021011103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1055510505561 + 1055510505562.
It is an arithmetic number, because the mean of its divisors is an integer number (1055510505562).
Almost surely, 22111021011123 is an apocalyptic number.
2111021011123 is a deficient number, since it is larger than the sum of its proper divisors (1).
2111021011123 is an equidigital number, since it uses as much as digits as its factorization.
2111021011123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 2111021011123 its reverse (3211101201112), we get a palindrome (5322122212235).
The spelling of 2111021011123 in words is "two trillion, one hundred eleven billion, twenty-one million, eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •