Base | Representation |
---|---|
bin | 101101101110100100010000… |
… | …100110101101111010101001 |
3 | 222101002010112120210102020201 |
4 | 231232210100212231322221 |
5 | 202330010111242021301 |
6 | 1551421344500152201 |
7 | 60234604604235103 |
oct | 5556442046557251 |
9 | 871063476712221 |
10 | 201112122220201 |
11 | 59098199013845 |
12 | 1a680a62998661 |
13 | 882aa3a6222ca |
14 | 3793c43042573 |
15 | 183b5c3da4201 |
hex | b6e9109adea9 |
201112122220201 has 2 divisors, whose sum is σ = 201112122220202. Its totient is φ = 201112122220200.
The previous prime is 201112122220199. The next prime is 201112122220277. The reversal of 201112122220201 is 102022221211102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 103902855225625 + 97209266994576 = 10193275^2 + 9859476^2 .
It is a cyclic number.
It is not a de Polignac number, because 201112122220201 - 21 = 201112122220199 is a prime.
Together with 201112122220199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (201112122220501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100556061110100 + 100556061110101.
It is an arithmetic number, because the mean of its divisors is an integer number (100556061110101).
Almost surely, 2201112122220201 is an apocalyptic number.
It is an amenable number.
201112122220201 is a deficient number, since it is larger than the sum of its proper divisors (1).
201112122220201 is an equidigital number, since it uses as much as digits as its factorization.
201112122220201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 201112122220201 its reverse (102022221211102), we get a palindrome (303134343431303).
The spelling of 201112122220201 in words is "two hundred one trillion, one hundred twelve billion, one hundred twenty-two million, two hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •