Base | Representation |
---|---|
bin | 101110001010100000010010… |
… | …111101110100101110000011 |
3 | 222121212200010000112020212121 |
4 | 232022200102331310232003 |
5 | 203102434030111304443 |
6 | 1555451341353505111 |
7 | 60523402351020202 |
oct | 5612402275645603 |
9 | 877780100466777 |
10 | 203032012213123 |
11 | 59768435951605 |
12 | 1a930b6a112197 |
13 | 8939ab5016212 |
14 | 381cb322bd239 |
15 | 18714dddd34ed |
hex | b8a812f74b83 |
203032012213123 has 2 divisors, whose sum is σ = 203032012213124. Its totient is φ = 203032012213122.
The previous prime is 203032012213109. The next prime is 203032012213231. The reversal of 203032012213123 is 321312210230302.
Together with next prime (203032012213231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-203032012213123 is a prime.
It is not a weakly prime, because it can be changed into another prime (203032012913123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101516006106561 + 101516006106562.
It is an arithmetic number, because the mean of its divisors is an integer number (101516006106562).
Almost surely, 2203032012213123 is an apocalyptic number.
203032012213123 is a deficient number, since it is larger than the sum of its proper divisors (1).
203032012213123 is an equidigital number, since it uses as much as digits as its factorization.
203032012213123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 203032012213123 its reverse (321312210230302), we get a palindrome (524344222443425).
The spelling of 203032012213123 in words is "two hundred three trillion, thirty-two billion, twelve million, two hundred thirteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •