Base | Representation |
---|---|
bin | 1001001001101000100001… |
… | …01001100011101001000111 |
3 | 2122020122220210102010221221 |
4 | 10210310100221203221013 |
5 | 10114140231441023421 |
6 | 110444002300021211 |
7 | 4144531621231561 |
oct | 444642051435107 |
9 | 78218823363857 |
10 | 20122201111111 |
11 | 6458860a40550 |
12 | 230b998531807 |
13 | b2c6914cb3c8 |
14 | 4d7cc3a50331 |
15 | 24d6581c7841 |
hex | 124d10a63a47 |
20122201111111 has 8 divisors (see below), whose sum is σ = 21951765955584. Its totient is φ = 18292681905720.
The previous prime is 20122201111091. The next prime is 20122201111121. The reversal of 20122201111111 is 11111110222102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20122201111111 - 211 = 20122201109063 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 (20122201111121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10484625 + ... + 12254458.
It is an arithmetic number, because the mean of its divisors is an integer number (2743970744448).
Almost surely, 220122201111111 is an apocalyptic number.
20122201111111 is a deficient number, since it is larger than the sum of its proper divisors (1829564844473).
20122201111111 is a wasteful number, since it uses less digits than its factorization.
20122201111111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22819541.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 20122201111111 its reverse (11111110222102), we get a palindrome (31233311333213).
The spelling of 20122201111111 in words is "twenty trillion, one hundred twenty-two billion, two hundred one million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •