Base | Representation |
---|---|
bin | 1001001001000011010011… |
… | …01100000101100100011111 |
3 | 2122011202100021122010102212 |
4 | 10210201221230011210133 |
5 | 10113323321322010421 |
6 | 110430455445511035 |
7 | 4143223516434416 |
oct | 444415154054437 |
9 | 78152307563385 |
10 | 20102220110111 |
11 | 6450338208787 |
12 | 2307b40a1247b |
13 | b2a828a463a9 |
14 | 4d6d4a0b247d |
15 | 24cd88e60e5b |
hex | 124869b0591f |
20102220110111 has 4 divisors (see below), whose sum is σ = 20103174607224. Its totient is φ = 20101265613000.
The previous prime is 20102220110051. The next prime is 20102220110129. The reversal of 20102220110111 is 11101102220102.
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 20102220110111 - 218 = 20102219847967 is a prime.
It is a super-2 number, since 2×201022201101112 (a number of 27 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 (20102220110911) 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, 477216965 + ... + 477259086.
It is an arithmetic number, because the mean of its divisors is an integer number (5025793651806).
Almost surely, 220102220110111 is an apocalyptic number.
20102220110111 is a deficient number, since it is larger than the sum of its proper divisors (954497113).
20102220110111 is an equidigital number, since it uses as much as digits as its factorization.
20102220110111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 954497112.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 20102220110111 its reverse (11101102220102), we get a palindrome (31203322330213).
The spelling of 20102220110111 in words is "twenty trillion, one hundred two billion, two hundred twenty million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •