Base | Representation |
---|---|
bin | 101101011110110110100010… |
… | …010000000111101010011101 |
3 | 222020020220011022121111022112 |
4 | 231132312202100013222131 |
5 | 202204312003401330133 |
6 | 1545233312324123405 |
7 | 60063565143016025 |
oct | 5536664220075235 |
9 | 866226138544275 |
10 | 200032234011293 |
11 | 588112152a7102 |
12 | 1a527706536565 |
13 | 877cc60433348 |
14 | 375787ca40a85 |
15 | 181d46dda2648 |
hex | b5eda2407a9d |
200032234011293 has 2 divisors, whose sum is σ = 200032234011294. Its totient is φ = 200032234011292.
The previous prime is 200032234011289. The next prime is 200032234011347. The reversal of 200032234011293 is 392110432230002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 118373486081764 + 81658747929529 = 10879958^2 + 9036523^2 .
It is a cyclic number.
It is not a de Polignac number, because 200032234011293 - 22 = 200032234011289 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200032234011593) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100016117005646 + 100016117005647.
It is an arithmetic number, because the mean of its divisors is an integer number (100016117005647).
Almost surely, 2200032234011293 is an apocalyptic number.
It is an amenable number.
200032234011293 is a deficient number, since it is larger than the sum of its proper divisors (1).
200032234011293 is an equidigital number, since it uses as much as digits as its factorization.
200032234011293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 32.
Adding to 200032234011293 its reverse (392110432230002), we get a palindrome (592142666241295).
The spelling of 200032234011293 in words is "two hundred trillion, thirty-two billion, two hundred thirty-four million, eleven thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •