Base | Representation |
---|---|
bin | 1001001001000011010001… |
… | …00111011101101110010111 |
3 | 2122011202022000210012011121 |
4 | 10210201220213131232113 |
5 | 10113323302220333421 |
6 | 110430454004144411 |
7 | 4143223210512355 |
oct | 444415047355627 |
9 | 78152260705147 |
10 | 20102202121111 |
11 | 6450329041340 |
12 | 2307b36998107 |
13 | b2a8250b8406 |
14 | 4d6d4794c7d5 |
15 | 24cd875aad41 |
hex | 1248689ddb97 |
20102202121111 has 4 divisors (see below), whose sum is σ = 21929675041224. Its totient is φ = 18274729201000.
The previous prime is 20102202121081. The next prime is 20102202121277. The reversal of 20102202121111 is 11112120220102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20102202121111 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20102202122111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 913736460040 + ... + 913736460061.
It is an arithmetic number, because the mean of its divisors is an integer number (5482418760306).
Almost surely, 220102202121111 is an apocalyptic number.
20102202121111 is a deficient number, since it is larger than the sum of its proper divisors (1827472920113).
20102202121111 is a wasteful number, since it uses less digits than its factorization.
20102202121111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1827472920112.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 20102202121111 its reverse (11112120220102), we get a palindrome (31214322341213).
The spelling of 20102202121111 in words is "twenty trillion, one hundred two billion, two hundred two million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.158 sec. • engine limits •