Base | Representation |
---|---|
bin | 101101101101000101010101… |
… | …100100011000010010001111 |
3 | 222100201101110110012012012002 |
4 | 231231011111210120102033 |
5 | 202321322342201120421 |
6 | 1551302451105502515 |
7 | 60224336066645516 |
oct | 5555052544302217 |
9 | 870641413165162 |
10 | 201010200020111 |
11 | 59058a4664a329 |
12 | 1a665159341a3b |
13 | 8821246808381 |
14 | 378cd349b967d |
15 | 1838b0b023b0b |
hex | b6d15591848f |
201010200020111 has 2 divisors, whose sum is σ = 201010200020112. Its totient is φ = 201010200020110.
The previous prime is 201010200020083. The next prime is 201010200020117. The reversal of 201010200020111 is 111020002010102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201010200020111 - 218 = 201010199757967 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201010200020092 and 201010200020101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201010200020117) 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, 100505100010055 + 100505100010056.
It is an arithmetic number, because the mean of its divisors is an integer number (100505100010056).
Almost surely, 2201010200020111 is an apocalyptic number.
201010200020111 is a deficient number, since it is larger than the sum of its proper divisors (1).
201010200020111 is an equidigital number, since it uses as much as digits as its factorization.
201010200020111 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 11.
Adding to 201010200020111 its reverse (111020002010102), we get a palindrome (312030202030213).
The spelling of 201010200020111 in words is "two hundred one trillion, ten billion, two hundred million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •