Base | Representation |
---|---|
bin | 101101011110011011010100… |
… | …011111011000010010111111 |
3 | 222020011002201210102122210020 |
4 | 231132123110133120102333 |
5 | 202203322132044220221 |
6 | 1545212040525143223 |
7 | 60061512041621136 |
oct | 5536332437302277 |
9 | 866132653378706 |
10 | 200003012101311 |
11 | 587aa88a299681 |
12 | 1a521b100bab13 |
13 | 877a28431c553 |
14 | 37562a9a9a91d |
15 | 181c80d723ac6 |
hex | b5e6d47d84bf |
200003012101311 has 8 divisors (see below), whose sum is σ = 282357193554864. Its totient is φ = 125492086024320.
The previous prime is 200003012101309. The next prime is 200003012101339. The reversal of 200003012101311 is 113101210300002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200003012101311 - 21 = 200003012101309 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200003012101391) 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 in 7 ways as a sum of consecutive naturals, for example, 1960813844080 + ... + 1960813844181.
It is an arithmetic number, because the mean of its divisors is an integer number (35294649194358).
Almost surely, 2200003012101311 is an apocalyptic number.
200003012101311 is a deficient number, since it is larger than the sum of its proper divisors (82354181453553).
200003012101311 is a wasteful number, since it uses less digits than its factorization.
200003012101311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3921627688281.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 200003012101311 its reverse (113101210300002), we get a palindrome (313104222401313).
The spelling of 200003012101311 in words is "two hundred trillion, three billion, twelve million, one hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •