Base | Representation |
---|---|
bin | 101101101101001110101010… |
… | …110100000010010000111011 |
3 | 222100202100022202210010011012 |
4 | 231231032222310002100323 |
5 | 202322003402322402141 |
6 | 1551311225251224135 |
7 | 60225142310263202 |
oct | 5555165264022073 |
9 | 870670282703135 |
10 | 201020220122171 |
11 | 5906221874430a |
12 | 1a667094ba804b |
13 | 8822182713548 |
14 | 378d605692239 |
15 | 1838ee5a52ceb |
hex | b6d3aad0243b |
201020220122171 has 2 divisors, whose sum is σ = 201020220122172. Its totient is φ = 201020220122170.
The previous prime is 201020220122159. The next prime is 201020220122203. The reversal of 201020220122171 is 171221022020102.
201020220122171 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201020220122171 - 218 = 201020219860027 is a prime.
It is a super-2 number, since 2×2010202201221712 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (201020220122671) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100510110061085 + 100510110061086.
It is an arithmetic number, because the mean of its divisors is an integer number (100510110061086).
Almost surely, 2201020220122171 is an apocalyptic number.
201020220122171 is a deficient number, since it is larger than the sum of its proper divisors (1).
201020220122171 is an equidigital number, since it uses as much as digits as its factorization.
201020220122171 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 448, while the sum is 23.
Adding to 201020220122171 its reverse (171221022020102), we get a palindrome (372241242142273).
The spelling of 201020220122171 in words is "two hundred one trillion, twenty billion, two hundred twenty million, one hundred twenty-two thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •