Base | Representation |
---|---|
bin | 101101100001100101011010… |
… | …101000100011111101001111 |
3 | 222020220211211211011220001211 |
4 | 231201211122220203331033 |
5 | 202220401040310120421 |
6 | 1545455445301115251 |
7 | 60113263344164155 |
oct | 5541453250437517 |
9 | 866824754156054 |
10 | 200220011020111 |
11 | 588839145500a5 |
12 | 1a557b906b8b27 |
13 | 8794887343954 |
14 | 37629b36593d5 |
15 | 18232ae2099e1 |
hex | b6195aa23f4f |
200220011020111 has 8 divisors (see below), whose sum is σ = 202166689364640. Its totient is φ = 198273386420832.
The previous prime is 200220011020109. The next prime is 200220011020147. The reversal of 200220011020111 is 111020110022002.
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 200220011020111 - 21 = 200220011020109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200220011020091 and 200220011020100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200220011020151) 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, 5929096 + ... + 20870893.
It is an arithmetic number, because the mean of its divisors is an integer number (25270836170580).
Almost surely, 2200220011020111 is an apocalyptic number.
200220011020111 is a deficient number, since it is larger than the sum of its proper divisors (1946678344529).
200220011020111 is a wasteful number, since it uses less digits than its factorization.
200220011020111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26872625.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200220011020111 its reverse (111020110022002), we get a palindrome (311240121042113).
The spelling of 200220011020111 in words is "two hundred trillion, two hundred twenty billion, eleven million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •