Base | Representation |
---|---|
bin | 10010101000001110… |
… | …010101110110111110 |
3 | 1220121222200002111002 |
4 | 102220032111312332 |
5 | 311431030413042 |
6 | 13104444330302 |
7 | 1305446621606 |
oct | 225016256676 |
9 | 56558602432 |
10 | 20002201022 |
11 | 85347a2751 |
12 | 3a62843992 |
13 | 1b69c9870b |
14 | d7a6d9c06 |
15 | 7c1053132 |
hex | 4a8395dbe |
20002201022 has 32 divisors (see below), whose sum is σ = 31737415680. Its totient is φ = 9435254400.
The previous prime is 20002200991. The next prime is 20002201039. The reversal of 20002201022 is 22010220002.
It is a junction number, because it is equal to n+sod(n) for n = 20002200994 and 20002201012.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 4362143 + ... + 4366725.
It is an arithmetic number, because the mean of its divisors is an integer number (991794240).
Almost surely, 220002201022 is an apocalyptic number.
20002201022 is a deficient number, since it is larger than the sum of its proper divisors (11735214658).
20002201022 is a wasteful number, since it uses less digits than its factorization.
20002201022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5888.
The product of its (nonzero) digits is 32, while the sum is 11.
Adding to 20002201022 its reverse (22010220002), we get a palindrome (42012421024).
It can be divided in two parts, 2000 and 2201022, that added together give a palindrome (2203022).
The spelling of 20002201022 in words is "twenty billion, two million, two hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •