Base | Representation |
---|---|
bin | 101101011110011011010100… |
… | …011111011010111100001011 |
3 | 222020011002201210110012122021 |
4 | 231132123110133122330023 |
5 | 202203322132100042024 |
6 | 1545212040525305311 |
7 | 60061512041664535 |
oct | 5536332437327413 |
9 | 866132653405567 |
10 | 200003012112139 |
11 | 587aa88a2a6825 |
12 | 1a521b10105237 |
13 | 877a284324462 |
14 | 37562a9aa0855 |
15 | 181c80d726de4 |
hex | b5e6d47daf0b |
200003012112139 has 2 divisors, whose sum is σ = 200003012112140. Its totient is φ = 200003012112138.
The previous prime is 200003012112073. The next prime is 200003012112143. The reversal of 200003012112139 is 931211210300002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200003012112139 - 27 = 200003012112011 is a prime.
It is a super-2 number, since 2×2000030121121392 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (200003012112439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100001506056069 + 100001506056070.
It is an arithmetic number, because the mean of its divisors is an integer number (100001506056070).
Almost surely, 2200003012112139 is an apocalyptic number.
200003012112139 is a deficient number, since it is larger than the sum of its proper divisors (1).
200003012112139 is an equidigital number, since it uses as much as digits as its factorization.
200003012112139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 25.
The spelling of 200003012112139 in words is "two hundred trillion, three billion, twelve million, one hundred twelve thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •