Base | Representation |
---|---|
bin | 1011101001100000010… |
… | …1101001000000011001 |
3 | 201010112201021221222202 |
4 | 2322120011221000121 |
5 | 11234321222024004 |
6 | 231533420255545 |
7 | 20313106610141 |
oct | 2723005510031 |
9 | 633481257882 |
10 | 200120111129 |
11 | 779636494a4 |
12 | 3294b9a15b5 |
13 | 15b43184853 |
14 | 9986029921 |
15 | 5313c9cb1e |
hex | 2e98169019 |
200120111129 has 2 divisors, whose sum is σ = 200120111130. Its totient is φ = 200120111128.
The previous prime is 200120111117. The next prime is 200120111137. The reversal of 200120111129 is 921111021002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 198813433225 + 1306677904 = 445885^2 + 36148^2 .
It is a cyclic number.
It is not a de Polignac number, because 200120111129 - 28 = 200120110873 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200120111129.
It is not a weakly prime, because it can be changed into another prime (200120111159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100060055564 + 100060055565.
It is an arithmetic number, because the mean of its divisors is an integer number (100060055565).
Almost surely, 2200120111129 is an apocalyptic number.
It is an amenable number.
200120111129 is a deficient number, since it is larger than the sum of its proper divisors (1).
200120111129 is an equidigital number, since it uses as much as digits as its factorization.
200120111129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 20.
The spelling of 200120111129 in words is "two hundred billion, one hundred twenty million, one hundred eleven thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •