Base | Representation |
---|---|
bin | 1011101001000100001… |
… | …1100101000010111111 |
3 | 201010020111021220110102 |
4 | 2322101003211002333 |
5 | 11234101021130421 |
6 | 231514003431315 |
7 | 20310145025150 |
oct | 2722103450277 |
9 | 633214256412 |
10 | 200002130111 |
11 | 77902a96623 |
12 | 3291838553b |
13 | 15b248b68b4 |
14 | 99744b7927 |
15 | 530874560b |
hex | 2e910e50bf |
200002130111 has 32 divisors (see below), whose sum is σ = 245893252608. Its totient is φ = 158773754880.
The previous prime is 200002130071. The next prime is 200002130113. The reversal of 200002130111 is 111031200002.
200002130111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 200002130111 - 222 = 199997935807 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200002130092 and 200002130101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200002130113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3822356 + ... + 3874326.
It is an arithmetic number, because the mean of its divisors is an integer number (7684164144).
Almost surely, 2200002130111 is an apocalyptic number.
200002130111 is a deficient number, since it is larger than the sum of its proper divisors (45891122497).
200002130111 is a wasteful number, since it uses less digits than its factorization.
200002130111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52511.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 200002130111 its reverse (111031200002), we get a palindrome (311033330113).
The spelling of 200002130111 in words is "two hundred billion, two million, one hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •