Base | Representation |
---|---|
bin | 11110111000011100111… |
… | …111010011011110100011 |
3 | 21111212202210002021000000 |
4 | 132320130333103132203 |
5 | 234232231222413443 |
6 | 4302531511231043 |
7 | 306216046035012 |
oct | 36703477233643 |
9 | 7455683067000 |
10 | 2122200201123 |
11 | 749024762642 |
12 | 2a3368678483 |
13 | 1251795207a2 |
14 | 74a020c6a79 |
15 | 3a30b1de8d3 |
hex | 1ee1cfd37a3 |
2122200201123 has 56 divisors (see below), whose sum is σ = 3196678422816. Its totient is φ = 1408215715200.
The previous prime is 2122200201119. The next prime is 2122200201127. The reversal of 2122200201123 is 3211020022212.
It is an interprime number because it is at equal distance from previous prime (2122200201119) and next prime (2122200201127).
It is not a de Polignac number, because 2122200201123 - 22 = 2122200201119 is a prime.
It is a super-2 number, since 2×21222002011232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2122200201096 and 2122200201105.
It is not an unprimeable number, because it can be changed into a prime (2122200201127) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 204229258 + ... + 204239648.
Almost surely, 22122200201123 is an apocalyptic number.
2122200201123 is a deficient number, since it is larger than the sum of its proper divisors (1074478221693).
2122200201123 is an equidigital number, since it uses as much as digits as its factorization.
2122200201123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11687 (or 11672 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 2122200201123 its reverse (3211020022212), we get a palindrome (5333220223335).
The spelling of 2122200201123 in words is "two trillion, one hundred twenty-two billion, two hundred million, two hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •