Base | Representation |
---|---|
bin | 101101101101000110000101… |
… | …010000011111000000001001 |
3 | 222100201110112012201000201011 |
4 | 231231012011100133000021 |
5 | 202321331012012023423 |
6 | 1551303102330323521 |
7 | 60224364653421403 |
oct | 5555060520370011 |
9 | 870643465630634 |
10 | 201011000111113 |
11 | 59059317242565 |
12 | 1a6653412895a1 |
13 | 88213434c07ba |
14 | 378cdacd69b73 |
15 | 1838b563b7b0d |
hex | b6d18541f009 |
201011000111113 has 2 divisors, whose sum is σ = 201011000111114. Its totient is φ = 201011000111112.
The previous prime is 201011000111087. The next prime is 201011000111123. The reversal of 201011000111113 is 311111000110102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 150398632018944 + 50612368092169 = 12263712^2 + 7114237^2 .
It is a cyclic number.
It is not a de Polignac number, because 201011000111113 - 237 = 200873561157641 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201011000111093 and 201011000111102.
It is not a weakly prime, because it can be changed into another prime (201011000111123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100505500055556 + 100505500055557.
It is an arithmetic number, because the mean of its divisors is an integer number (100505500055557).
Almost surely, 2201011000111113 is an apocalyptic number.
It is an amenable number.
201011000111113 is a deficient number, since it is larger than the sum of its proper divisors (1).
201011000111113 is an equidigital number, since it uses as much as digits as its factorization.
201011000111113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 201011000111113 its reverse (311111000110102), we get a palindrome (512122000221215).
The spelling of 201011000111113 in words is "two hundred one trillion, eleven billion, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •