Base | Representation |
---|---|
bin | 1001001001010011110101… |
… | …11110001110001000001110 |
3 | 2122012121021010201211110210 |
4 | 10210221322332032020032 |
5 | 10114000013100323042 |
6 | 110434524540543250 |
7 | 4143656543362356 |
oct | 444517276161016 |
9 | 78177233654423 |
10 | 20111100011022 |
11 | 645408472a769 |
12 | 23097ba851b26 |
13 | b2b612666627 |
14 | 4d754d583b66 |
15 | 24d208817a9c |
hex | 124a7af8e20e |
20111100011022 has 8 divisors (see below), whose sum is σ = 40222200022056. Its totient is φ = 6703700003672.
The previous prime is 20111100011021. The next prime is 20111100011029. The reversal of 20111100011022 is 22011000111102.
It is a sphenic number, since it is the product of 3 distinct primes.
20111100011022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 20111100010989 and 20111100011007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20111100011021) 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, 1675925000913 + ... + 1675925000924.
It is an arithmetic number, because the mean of its divisors is an integer number (5027775002757).
Almost surely, 220111100011022 is an apocalyptic number.
20111100011022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20111100011022 is a wasteful number, since it uses less digits than its factorization.
20111100011022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3351850001842.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 20111100011022 its reverse (22011000111102), we get a palindrome (42122100122124).
The spelling of 20111100011022 in words is "twenty trillion, one hundred eleven billion, one hundred million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •