Base | Representation |
---|---|
bin | 101101101101000101001010… |
… | …010011101101001111001111 |
3 | 222100201100222021201001200001 |
4 | 231231011022103231033033 |
5 | 202321322000320200421 |
6 | 1551302420240345131 |
7 | 60224331314106403 |
oct | 5555051223551717 |
9 | 870640867631601 |
10 | 201010011100111 |
11 | 59058959a449a4 |
12 | 1a6651060151a7 |
13 | 88212166303a5 |
14 | 378cd1787d103 |
15 | 1838ae9657691 |
hex | b6d14a4ed3cf |
201010011100111 has 2 divisors, whose sum is σ = 201010011100112. Its totient is φ = 201010011100110.
The previous prime is 201010011100109. The next prime is 201010011100201. The reversal of 201010011100111 is 111001110010102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201010011100111 - 21 = 201010011100109 is a prime.
Together with 201010011100109, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201010011100511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100505005550055 + 100505005550056.
It is an arithmetic number, because the mean of its divisors is an integer number (100505005550056).
Almost surely, 2201010011100111 is an apocalyptic number.
201010011100111 is a deficient number, since it is larger than the sum of its proper divisors (1).
201010011100111 is an equidigital number, since it uses as much as digits as its factorization.
201010011100111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 201010011100111 its reverse (111001110010102), we get a palindrome (312011121110213).
The spelling of 201010011100111 in words is "two hundred one trillion, ten billion, eleven million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •