Base | Representation |
---|---|
bin | 1011101001100010111… |
… | …1101000101111110101 |
3 | 201010120111000021111001 |
4 | 2322120233220233311 |
5 | 11234332031320432 |
6 | 231534452243301 |
7 | 20313302311255 |
oct | 2723057505765 |
9 | 633514007431 |
10 | 200131120117 |
11 | 77969888735 |
12 | 32953610531 |
13 | 15b4553a746 |
14 | 9987693965 |
15 | 5314c249e7 |
hex | 2e98be8bf5 |
200131120117 has 2 divisors, whose sum is σ = 200131120118. Its totient is φ = 200131120116.
The previous prime is 200131120069. The next prime is 200131120121. The reversal of 200131120117 is 711021131002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 200100550276 + 30569841 = 447326^2 + 5529^2 .
It is a cyclic number.
It is not a de Polignac number, because 200131120117 - 215 = 200131087349 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200131120094 and 200131120103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200131120177) 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, 100065560058 + 100065560059.
It is an arithmetic number, because the mean of its divisors is an integer number (100065560059).
Almost surely, 2200131120117 is an apocalyptic number.
It is an amenable number.
200131120117 is a deficient number, since it is larger than the sum of its proper divisors (1).
200131120117 is an equidigital number, since it uses as much as digits as its factorization.
200131120117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 19.
Adding to 200131120117 its reverse (711021131002), we get a palindrome (911152251119).
The spelling of 200131120117 in words is "two hundred billion, one hundred thirty-one million, one hundred twenty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •