Base | Representation |
---|---|
bin | 101101100000000000000101… |
… | …000011010001101010101111 |
3 | 222020112102222122221011101002 |
4 | 231200000011003101222233 |
5 | 202212110214424000421 |
6 | 1545333452220510515 |
7 | 60102362052240152 |
oct | 5540000503215257 |
9 | 866472878834332 |
10 | 200111201000111 |
11 | 58841758092635 |
12 | 1a53aa843ab43b |
13 | 878753654052b |
14 | 375b610517c99 |
15 | 182054181db0b |
hex | b600050d1aaf |
200111201000111 has 2 divisors, whose sum is σ = 200111201000112. Its totient is φ = 200111201000110.
The previous prime is 200111201000093. The next prime is 200111201000119. The reversal of 200111201000111 is 111000102111002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200111201000111 - 26 = 200111201000047 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200111201000092 and 200111201000101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200111201000119) 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 as a sum of consecutive naturals, namely, 100055600500055 + 100055600500056.
It is an arithmetic number, because the mean of its divisors is an integer number (100055600500056).
Almost surely, 2200111201000111 is an apocalyptic number.
200111201000111 is a deficient number, since it is larger than the sum of its proper divisors (1).
200111201000111 is an equidigital number, since it uses as much as digits as its factorization.
200111201000111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 200111201000111 its reverse (111000102111002), we get a palindrome (311111303111113).
The spelling of 200111201000111 in words is "two hundred trillion, one hundred eleven billion, two hundred one million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •