Base | Representation |
---|---|
bin | 1011101001011011110… |
… | …1010001101001110111 |
3 | 201010111101121012000111 |
4 | 2322112331101221313 |
5 | 11234301343003421 |
6 | 231531501523451 |
7 | 20312456431024 |
oct | 2722675215167 |
9 | 633441535014 |
10 | 200101141111 |
11 | 77953971aa3 |
12 | 32945573587 |
13 | 15b3c2721a1 |
14 | 99836cc54b |
15 | 53122a1ee1 |
hex | 2e96f51a77 |
200101141111 has 2 divisors, whose sum is σ = 200101141112. Its totient is φ = 200101141110.
The previous prime is 200101141091. The next prime is 200101141241. The reversal of 200101141111 is 111141101002.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200101141111 - 27 = 200101140983 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200101141091 and 200101141100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200101141711) 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 as a sum of consecutive naturals, namely, 100050570555 + 100050570556.
It is an arithmetic number, because the mean of its divisors is an integer number (100050570556).
Almost surely, 2200101141111 is an apocalyptic number.
200101141111 is a deficient number, since it is larger than the sum of its proper divisors (1).
200101141111 is an equidigital number, since it uses as much as digits as its factorization.
200101141111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 200101141111 its reverse (111141101002), we get a palindrome (311242242113).
The spelling of 200101141111 in words is "two hundred billion, one hundred one million, one hundred forty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •