Base | Representation |
---|---|
bin | 1001000110101110000100… |
… | …01010100000101111011111 |
3 | 2121220002112120201000102011 |
4 | 10203113002022200233133 |
5 | 10111020230111231421 |
6 | 110330005324012051 |
7 | 4134356206546312 |
oct | 443270212405737 |
9 | 77802476630364 |
10 | 20022100102111 |
11 | 641a363594938 |
12 | 22b4500991027 |
13 | b230caab3b33 |
14 | 4d3109418979 |
15 | 24ac4a1894e1 |
hex | 1235c22a0bdf |
20022100102111 has 4 divisors (see below), whose sum is σ = 20022134000400. Its totient is φ = 20022066203824.
The previous prime is 20022100102021. The next prime is 20022100102159. The reversal of 20022100102111 is 11120100122002.
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 20022100102111 - 211 = 20022100100063 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20022100102091 and 20022100102100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20022100102181) 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, 16047166 + ... + 17249803.
It is an arithmetic number, because the mean of its divisors is an integer number (5005533500100).
Almost surely, 220022100102111 is an apocalyptic number.
20022100102111 is a deficient number, since it is larger than the sum of its proper divisors (33898289).
20022100102111 is an equidigital number, since it uses as much as digits as its factorization.
20022100102111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33898288.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20022100102111 its reverse (11120100122002), we get a palindrome (31142200224113).
The spelling of 20022100102111 in words is "twenty trillion, twenty-two billion, one hundred million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •