Base | Representation |
---|---|
bin | 1011101001000110010… |
… | …1110101101010111110 |
3 | 201010021010012012001201 |
4 | 2322101211311222332 |
5 | 11234110321023402 |
6 | 231514524130114 |
7 | 20310314251615 |
oct | 2722145655276 |
9 | 633233165051 |
10 | 200011111102 |
11 | 77908070130 |
12 | 3291b39693a |
13 | 15b2670c6aa |
14 | 997577487c |
15 | 530941b687 |
hex | 2e91975abe |
200011111102 has 8 divisors (see below), whose sum is σ = 327290909112. Its totient is φ = 90914141400.
The previous prime is 200011111099. The next prime is 200011111117. The reversal of 200011111102 is 201111110002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4545707049 + ... + 4545707092.
It is an arithmetic number, because the mean of its divisors is an integer number (40911363639).
Almost surely, 2200011111102 is an apocalyptic number.
200011111102 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
200011111102 is a deficient number, since it is larger than the sum of its proper divisors (127279798010).
200011111102 is a wasteful number, since it uses less digits than its factorization.
200011111102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9091414154.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 200011111102 its reverse (201111110002), we get a palindrome (401122221104).
It can be divided in two parts, 200011 and 111102, that added together give a palindrome (311113).
The spelling of 200011111102 in words is "two hundred billion, eleven million, one hundred eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •