Base | Representation |
---|---|
bin | 101101011110011001100011… |
… | …001011101011010110111110 |
3 | 222020010220211022101100110110 |
4 | 231132121203023223112332 |
5 | 202203304233421023402 |
6 | 1545211124140250450 |
7 | 60061413656515500 |
oct | 5536314313532676 |
9 | 866126738340413 |
10 | 200001111111102 |
11 | 587a9aa4227594 |
12 | 1a52167b540a26 |
13 | 877a040530082 |
14 | 3756169415d70 |
15 | 181c74b8bc56c |
hex | b5e6632eb5be |
200001111111102 has 48 divisors (see below), whose sum is σ = 469915724458512. Its totient is φ = 56577400588800.
The previous prime is 200001111111083. The next prime is 200001111111107. The reversal of 200001111111102 is 201111111100002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200001111111107) 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 23 ways as a sum of consecutive naturals, for example, 3367672723 + ... + 3367732110.
It is an arithmetic number, because the mean of its divisors is an integer number (9789910926219).
Almost surely, 2200001111111102 is an apocalyptic number.
200001111111102 is an abundant number, since it is smaller than the sum of its proper divisors (269914613347410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200001111111102 is a wasteful number, since it uses less digits than its factorization.
200001111111102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6735404953 (or 6735404946 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 200001111111102 its reverse (201111111100002), we get a palindrome (401112222211104).
The spelling of 200001111111102 in words is "two hundred trillion, one billion, one hundred eleven million, one hundred eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •