Base | Representation |
---|---|
bin | 101101101100111100110010… |
… | …100001011011100110101111 |
3 | 222100200111202211100001120002 |
4 | 231230330302201123212233 |
5 | 202321200043130011002 |
6 | 1551254332251214515 |
7 | 60223562464002461 |
oct | 5554746241334657 |
9 | 870614684301502 |
10 | 201001022110127 |
11 | 59055066993758 |
12 | 1a66341774743b |
13 | 88204132365c5 |
14 | 378c703ad2131 |
15 | 1838770403002 |
hex | b6cf3285b9af |
201001022110127 has 2 divisors, whose sum is σ = 201001022110128. Its totient is φ = 201001022110126.
The previous prime is 201001022110081. The next prime is 201001022110153. The reversal of 201001022110127 is 721011220100102.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201001022110127 - 238 = 200726144203183 is a prime.
It is a super-2 number, since 2×2010010221101272 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201001022110099 and 201001022110108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201001022110177) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100500511055063 + 100500511055064.
It is an arithmetic number, because the mean of its divisors is an integer number (100500511055064).
Almost surely, 2201001022110127 is an apocalyptic number.
201001022110127 is a deficient number, since it is larger than the sum of its proper divisors (1).
201001022110127 is an equidigital number, since it uses as much as digits as its factorization.
201001022110127 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 112, while the sum is 20.
Adding to 201001022110127 its reverse (721011220100102), we get a palindrome (922012242210229).
The spelling of 201001022110127 in words is "two hundred one trillion, one billion, twenty-two million, one hundred ten thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •