Base | Representation |
---|---|
bin | 110000010001011010101100… |
… | …001111100100000000100011 |
3 | 1000211200222110200111021221012 |
4 | 300101122230033210000203 |
5 | 210311333244014431313 |
6 | 2031310413001451135 |
7 | 62501252210124134 |
oct | 6021325417440043 |
9 | 1024628420437835 |
10 | 212303123202083 |
11 | 617122813533a1 |
12 | 1b9899264a0aab |
13 | 916013886a124 |
14 | 3a5d75145bc8b |
15 | 198275894bda8 |
hex | c116ac3e4023 |
212303123202083 has 2 divisors, whose sum is σ = 212303123202084. Its totient is φ = 212303123202082.
The previous prime is 212303123202043. The next prime is 212303123202091. The reversal of 212303123202083 is 380202321303212.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 212303123202083 - 212 = 212303123197987 is a prime.
It is a super-2 number, since 2×2123031232020832 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (212303123202043) 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, 106151561601041 + 106151561601042.
It is an arithmetic number, because the mean of its divisors is an integer number (106151561601042).
Almost surely, 2212303123202083 is an apocalyptic number.
212303123202083 is a deficient number, since it is larger than the sum of its proper divisors (1).
212303123202083 is an equidigital number, since it uses as much as digits as its factorization.
212303123202083 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 32.
Adding to 212303123202083 its reverse (380202321303212), we get a palindrome (592505444505295).
The spelling of 212303123202083 in words is "two hundred twelve trillion, three hundred three billion, one hundred twenty-three million, two hundred two thousand, eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •