Base | Representation |
---|---|
bin | 101101101110011001111010… |
… | …111111000111111001110111 |
3 | 222101001001212222221221102212 |
4 | 231232121322333013321313 |
5 | 202324314343124213421 |
6 | 1551412311214124035 |
7 | 60234032540622626 |
oct | 5556317277077167 |
9 | 871031788857385 |
10 | 201101022101111 |
11 | 59093512313000 |
12 | 1a67a8854b061b |
13 | 882998ba41bc2 |
14 | 37934acb4d6bd |
15 | 183b174639e5b |
hex | b6e67afc7e77 |
201101022101111 has 16 divisors (see below), whose sum is σ = 221657803084800. Its totient is φ = 182437442132440.
The previous prime is 201101022101053. The next prime is 201101022101131. The reversal of 201101022101111 is 111101220101102.
It is a de Polignac number, because none of the positive numbers 2k-201101022101111 is a prime.
It is a super-2 number, since 2×2011010221011112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201101022101131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 157076621 + ... + 158351718.
It is an arithmetic number, because the mean of its divisors is an integer number (13853612692800).
Almost surely, 2201101022101111 is an apocalyptic number.
201101022101111 is a deficient number, since it is larger than the sum of its proper divisors (20556780983689).
201101022101111 is an equidigital number, since it uses as much as digits as its factorization.
201101022101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 315428851 (or 315428829 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 201101022101111 its reverse (111101220101102), we get a palindrome (312202242202213).
The spelling of 201101022101111 in words is "two hundred one trillion, one hundred one billion, twenty-two million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •