Base | Representation |
---|---|
bin | 11111000001110001110… |
… | …000000011011010100011 |
3 | 21112211121112102120000211 |
4 | 133001301300003122203 |
5 | 234413232310413443 |
6 | 4311305203154551 |
7 | 310022130446254 |
oct | 37016160033243 |
9 | 7484545376024 |
10 | 2132212201123 |
11 | 7522a2223404 |
12 | 2a52a1675a57 |
13 | 1260b384cc44 |
14 | 752b1a90b2b |
15 | 3a6e516d19d |
hex | 1f071c036a3 |
2132212201123 has 2 divisors, whose sum is σ = 2132212201124. Its totient is φ = 2132212201122.
The previous prime is 2132212201109. The next prime is 2132212201139. The reversal of 2132212201123 is 3211022122312.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2132212201123 is a prime.
It is a super-2 number, since 2×21322122011232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2132212201094 and 2132212201103.
It is not a weakly prime, because it can be changed into another prime (2132212201723) 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, 1066106100561 + 1066106100562.
It is an arithmetic number, because the mean of its divisors is an integer number (1066106100562).
Almost surely, 22132212201123 is an apocalyptic number.
2132212201123 is a deficient number, since it is larger than the sum of its proper divisors (1).
2132212201123 is an equidigital number, since it uses as much as digits as its factorization.
2132212201123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 2132212201123 its reverse (3211022122312), we get a palindrome (5343234323435).
The spelling of 2132212201123 in words is "two trillion, one hundred thirty-two billion, two hundred twelve million, two hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •