Base | Representation |
---|---|
bin | 1011101101100100011… |
… | …1011110101010100101 |
3 | 201020100202012112222011 |
4 | 2323121013132222211 |
5 | 11244040021041401 |
6 | 232233552234221 |
7 | 20352125143036 |
oct | 2733107365245 |
9 | 636322175864 |
10 | 201211112101 |
11 | 7837347769a |
12 | 32bb523b971 |
13 | 15c8820445c |
14 | 9a4aca4a8d |
15 | 5379957451 |
hex | 2ed91deaa5 |
201211112101 has 2 divisors, whose sum is σ = 201211112102. Its totient is φ = 201211112100.
The previous prime is 201211112099. The next prime is 201211112117. The reversal of 201211112101 is 101211112102.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 104115928900 + 97095183201 = 322670^2 + 311601^2 .
It is a cyclic number.
It is not a de Polignac number, because 201211112101 - 21 = 201211112099 is a prime.
Together with 201211112099, 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 (201211112191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100605556050 + 100605556051.
It is an arithmetic number, because the mean of its divisors is an integer number (100605556051).
Almost surely, 2201211112101 is an apocalyptic number.
It is an amenable number.
201211112101 is a deficient number, since it is larger than the sum of its proper divisors (1).
201211112101 is an equidigital number, since it uses as much as digits as its factorization.
201211112101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 201211112101 its reverse (101211112102), we get a palindrome (302422224203).
Subtracting from 201211112101 its reverse (101211112102), we obtain a palindrome (99999999999).
The spelling of 201211112101 in words is "two hundred one billion, two hundred eleven million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •