Base | Representation |
---|---|
bin | 1011101101001010011… |
… | …1010101010111011111 |
3 | 201020002010221012122011 |
4 | 2323102213111113133 |
5 | 11243324104201421 |
6 | 232215054132051 |
7 | 20346331661314 |
oct | 2732247252737 |
9 | 636063835564 |
10 | 201102022111 |
11 | 78317937781 |
12 | 32b847b1027 |
13 | 15c6b72a373 |
14 | 9a3a5c8d0b |
15 | 53700a94e1 |
hex | 2ed29d55df |
201102022111 has 4 divisors (see below), whose sum is σ = 201463067592. Its totient is φ = 200740976632.
The previous prime is 201102022109. The next prime is 201102022141. The reversal of 201102022111 is 111220201102.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 111220201102 = 2 ⋅55610100551.
It is a cyclic number.
It is not a de Polignac number, because 201102022111 - 21 = 201102022109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201102022091 and 201102022100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201102022141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 180521905 + ... + 180523018.
It is an arithmetic number, because the mean of its divisors is an integer number (50365766898).
Almost surely, 2201102022111 is an apocalyptic number.
201102022111 is a deficient number, since it is larger than the sum of its proper divisors (361045481).
201102022111 is an equidigital number, since it uses as much as digits as its factorization.
201102022111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 361045480.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 201102022111 its reverse (111220201102), we get a palindrome (312322223213).
The spelling of 201102022111 in words is "two hundred one billion, one hundred two million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •