Base | Representation |
---|---|
bin | 1011101001000100001… |
… | …1110110100111111111 |
3 | 201010020111102120020002 |
4 | 2322101003312213333 |
5 | 11234101030431421 |
6 | 231514005144515 |
7 | 20310145445105 |
oct | 2722103664777 |
9 | 633214376202 |
10 | 200002202111 |
11 | 77903035728 |
12 | 329183bb13b |
13 | 15b249105ba |
14 | 99744d5c75 |
15 | 530875bb0b |
hex | 2e910f69ff |
200002202111 has 8 divisors (see below), whose sum is σ = 207262465200. Its totient is φ = 192766181440.
The previous prime is 200002202093. The next prime is 200002202149. The reversal of 200002202111 is 111202200002.
It is a happy number.
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 200002202111 - 230 = 198928460287 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200002202092 and 200002202101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200002252111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6043805 + ... + 6076806.
It is an arithmetic number, because the mean of its divisors is an integer number (25907808150).
Almost surely, 2200002202111 is an apocalyptic number.
200002202111 is a deficient number, since it is larger than the sum of its proper divisors (7260263089).
200002202111 is a wasteful number, since it uses less digits than its factorization.
200002202111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12121209.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 200002202111 its reverse (111202200002), we get a palindrome (311204402113).
The spelling of 200002202111 in words is "two hundred billion, two million, two hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •