Base | Representation |
---|---|
bin | 10010101000001010… |
… | …001011100000000110 |
3 | 1220121220121122220200 |
4 | 102220022023200012 |
5 | 311430241010042 |
6 | 13104405111330 |
7 | 1305434426055 |
oct | 225012134006 |
9 | 56556548820 |
10 | 20001110022 |
11 | 8534117aa3 |
12 | 3a623b8546 |
13 | 1b699a5c5a |
14 | d7a4d439c |
15 | 7c0dd9c4c |
hex | 4a828b806 |
20001110022 has 24 divisors (see below), whose sum is σ = 43364477520. Its totient is φ = 6662615280.
The previous prime is 20001109993. The next prime is 20001110023. The reversal of 20001110022 is 22001110002.
It is a super-2 number, since 2×200011100222 (a number of 21 digits) contains 22 as substring.
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 = 20001109986 and 20001110013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20001110023) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 340497 + ... + 394892.
It is an arithmetic number, because the mean of its divisors is an integer number (1806853230).
Almost surely, 220001110022 is an apocalyptic number.
20001110022 is an abundant number, since it is smaller than the sum of its proper divisors (23363367498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20001110022 is a wasteful number, since it uses less digits than its factorization.
20001110022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 736908 (or 736905 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 20001110022 its reverse (22001110002), we get a palindrome (42002220024).
It can be divided in two parts, 20001 and 110022, that multiplied together give a palindrome (2200550022).
The spelling of 20001110022 in words is "twenty billion, one million, one hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •