Base | Representation |
---|---|
bin | 101101100000001000011101… |
… | …100011110010010000111011 |
3 | 222020120022012222002220212211 |
4 | 231200020131203302100323 |
5 | 202212232133220010021 |
6 | 1545341541321515551 |
7 | 60103131110353111 |
oct | 5540103543622073 |
9 | 866508188086784 |
10 | 200120202110011 |
11 | 58845556a71737 |
12 | 1a540776942bb7 |
13 | 878833c2bba71 |
14 | 375bc25b3bab1 |
15 | 18208bbb693e1 |
hex | b6021d8f243b |
200120202110011 has 8 divisors (see below), whose sum is σ = 201738815953920. Its totient is φ = 198506591710248.
The previous prime is 200120202110009. The next prime is 200120202110021. The reversal of 200120202110011 is 110011202021002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200120202110011 - 21 = 200120202110009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200120202109973 and 200120202110000.
It is not an unprimeable number, because it can be changed into a prime (200120202110021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1250780721 + ... + 1250940706.
It is an arithmetic number, because the mean of its divisors is an integer number (25217351994240).
Almost surely, 2200120202110011 is an apocalyptic number.
200120202110011 is a deficient number, since it is larger than the sum of its proper divisors (1618613843909).
200120202110011 is a wasteful number, since it uses less digits than its factorization.
200120202110011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2501722073.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200120202110011 its reverse (110011202021002), we get a palindrome (310131404131013).
The spelling of 200120202110011 in words is "two hundred trillion, one hundred twenty billion, two hundred two million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •