Base | Representation |
---|---|
bin | 1011101001000100001… |
… | …1100000011010000111 |
3 | 201010020111020221101201 |
4 | 2322101003200122013 |
5 | 11234101020023421 |
6 | 231514003203331 |
7 | 20310144615565 |
oct | 2722103403207 |
9 | 633214227351 |
10 | 200002111111 |
11 | 77902a83320 |
12 | 32918376547 |
13 | 15b248ab05a |
14 | 99744b0a35 |
15 | 530873eb91 |
hex | 2e910e0687 |
200002111111 has 16 divisors (see below), whose sum is σ = 223964875008. Its totient is φ = 177021028800.
The previous prime is 200002111097. The next prime is 200002111187. The reversal of 200002111111 is 111111200002.
It is not a de Polignac number, because 200002111111 - 25 = 200002111079 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200002111811) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 235665 + ... + 674938.
It is an arithmetic number, because the mean of its divisors is an integer number (13997804688).
Almost surely, 2200002111111 is an apocalyptic number.
200002111111 is a deficient number, since it is larger than the sum of its proper divisors (23962763897).
200002111111 is a wasteful number, since it uses less digits than its factorization.
200002111111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 911142.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 200002111111 its reverse (111111200002), we get a palindrome (311113311113).
It can be divided in two parts, 200002 and 111111, that multiplied together give a palindrome (22222422222).
The spelling of 200002111111 in words is "two hundred billion, two million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •