Base | Representation |
---|---|
bin | 10010101000000110… |
… | …010111100110101110 |
3 | 1220121211201220112200 |
4 | 102220012113212232 |
5 | 311430012023042 |
6 | 13104331442330 |
7 | 1305423065403 |
oct | 225006274656 |
9 | 56554656480 |
10 | 20000111022 |
11 | 85335a5481 |
12 | 3a61bb63a6 |
13 | 1b69716328 |
14 | d7a3142aa |
15 | 7c0c8dc4c |
hex | 4a81979ae |
20000111022 has 12 divisors (see below), whose sum is σ = 43333573920. Its totient is φ = 6666703668.
The previous prime is 20000110987. The next prime is 20000111039. The reversal of 20000111022 is 22011100002.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 20000110995 and 20000111013.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 555558622 + ... + 555558657.
It is an arithmetic number, because the mean of its divisors is an integer number (3611131160).
Almost surely, 220000111022 is an apocalyptic number.
20000111022 is an abundant number, since it is smaller than the sum of its proper divisors (23333462898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20000111022 is a wasteful number, since it uses less digits than its factorization.
20000111022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1111117287 (or 1111117284 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 20000111022 its reverse (22011100002), we get a palindrome (42011211024).
The spelling of 20000111022 in words is "twenty billion, one hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •