Base | Representation |
---|---|
bin | 101101101110011010110101… |
… | …010001100011011101100111 |
3 | 222101001011102011001220202202 |
4 | 231232122311101203131213 |
5 | 202324323344000323421 |
6 | 1551412552230125115 |
7 | 60234066014001323 |
oct | 5556326521433547 |
9 | 871034364056682 |
10 | 201102000011111 |
11 | 59093974319291 |
12 | 1a67aab8ab079b |
13 | 8829ab6516584 |
14 | 379356298a983 |
15 | 183b1d040610b |
hex | b6e6b5463767 |
201102000011111 has 4 divisors (see below), whose sum is σ = 207589161301824. Its totient is φ = 194614838720400.
The previous prime is 201102000011009. The next prime is 201102000011141. The reversal of 201102000011111 is 111110000201102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 201102000011111 - 222 = 201101995816807 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201102000011092 and 201102000011101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201102000011141) 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, 3243580645310 + ... + 3243580645371.
It is an arithmetic number, because the mean of its divisors is an integer number (51897290325456).
Almost surely, 2201102000011111 is an apocalyptic number.
201102000011111 is a deficient number, since it is larger than the sum of its proper divisors (6487161290713).
201102000011111 is an equidigital number, since it uses as much as digits as its factorization.
201102000011111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6487161290712.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 201102000011111 its reverse (111110000201102), we get a palindrome (312212000212213).
The spelling of 201102000011111 in words is "two hundred one trillion, one hundred two billion, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •