Base | Representation |
---|---|
bin | 1011101001000100001… |
… | …1100000101010000011 |
3 | 201010020111020222210111 |
4 | 2322101003200222003 |
5 | 11234101020042011 |
6 | 231514003212151 |
7 | 20310144621553 |
oct | 2722103405203 |
9 | 633214228714 |
10 | 200002112131 |
11 | 77902a84068 |
12 | 32918377057 |
13 | 15b248ab663 |
14 | 99744b1163 |
15 | 5308740121 |
hex | 2e910e0a83 |
200002112131 has 2 divisors, whose sum is σ = 200002112132. Its totient is φ = 200002112130.
The previous prime is 200002112111. The next prime is 200002112143. The reversal of 200002112131 is 131211200002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200002112131 - 27 = 200002112003 is a prime.
It is a super-2 number, since 2×2000021121312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (200002112111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100001056065 + 100001056066.
It is an arithmetic number, because the mean of its divisors is an integer number (100001056066).
Almost surely, 2200002112131 is an apocalyptic number.
200002112131 is a deficient number, since it is larger than the sum of its proper divisors (1).
200002112131 is an equidigital number, since it uses as much as digits as its factorization.
200002112131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 200002112131 its reverse (131211200002), we get a palindrome (331213312133).
The spelling of 200002112131 in words is "two hundred billion, two million, one hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •