Base | Representation |
---|---|
bin | 101101101101001110011111… |
… | …000000010011000011111111 |
3 | 222100202022210221222222111111 |
4 | 231231032133000103003333 |
5 | 202322003001113310421 |
6 | 1551311153453102451 |
7 | 60225134353331053 |
oct | 5555163700230377 |
9 | 870668727888444 |
10 | 201020022010111 |
11 | 59062126930837 |
12 | 1a66703a787a27 |
13 | 882215066a685 |
14 | 378d5c7241c63 |
15 | 1838ed346cee1 |
hex | b6d39f0130ff |
201020022010111 has 4 divisors (see below), whose sum is σ = 201020545906912. Its totient is φ = 201019498113312.
The previous prime is 201020022010069. The next prime is 201020022010127. The reversal of 201020022010111 is 111010220020102.
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 201020022010111 - 213 = 201020022001919 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201020022010091 and 201020022010100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201020022110111) 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, 261372426 + ... + 262140391.
It is an arithmetic number, because the mean of its divisors is an integer number (50255136476728).
Almost surely, 2201020022010111 is an apocalyptic number.
201020022010111 is a deficient number, since it is larger than the sum of its proper divisors (523896801).
201020022010111 is an equidigital number, since it uses as much as digits as its factorization.
201020022010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 523896800.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 201020022010111 its reverse (111010220020102), we get a palindrome (312030242030213).
The spelling of 201020022010111 in words is "two hundred one trillion, twenty billion, twenty-two million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •