Base | Representation |
---|---|
bin | 101101011111111111111010… |
… | …011101000001011100000011 |
3 | 222020112102112021100222110220 |
4 | 231133333322131001130003 |
5 | 202212104333414400003 |
6 | 1545333422425554123 |
7 | 60102354463043406 |
oct | 5537777235013403 |
9 | 866472467328426 |
10 | 200111023200003 |
11 | 588416767927a3 |
12 | 1a53aa34945943 |
13 | 8787508759a76 |
14 | 375b5d4a73d3d |
15 | 1820530dec353 |
hex | b5fffa741703 |
200111023200003 has 16 divisors (see below), whose sum is σ = 271175262912000. Its totient is φ = 131235435752960.
The previous prime is 200111023199977. The next prime is 200111023200031. The reversal of 200111023200003 is 300002320111002.
It is a cyclic number.
It is not a de Polignac number, because 200111023200003 - 26 = 200111023199939 is a prime.
It is a super-2 number, since 2×2001110232000032 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (200111023200103) 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 15 ways as a sum of consecutive naturals, for example, 1046105223 + ... + 1046296496.
It is an arithmetic number, because the mean of its divisors is an integer number (16948453932000).
Almost surely, 2200111023200003 is an apocalyptic number.
200111023200003 is a deficient number, since it is larger than the sum of its proper divisors (71064239711997).
200111023200003 is a wasteful number, since it uses less digits than its factorization.
200111023200003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2092402242.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 200111023200003 its reverse (300002320111002), we get a palindrome (500113343311005).
The spelling of 200111023200003 in words is "two hundred trillion, one hundred eleven billion, twenty-three million, two hundred thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •