Base | Representation |
---|---|
bin | 110010000011001100110001… |
… | …101010001001110010001000 |
3 | 1001212101110212201202102122221 |
4 | 302003030301222021302020 |
5 | 212322440232204133000 |
6 | 2100054424341023424 |
7 | 64236206240356216 |
oct | 6203146152116210 |
9 | 1055343781672587 |
10 | 220122202021000 |
11 | 64157335515474 |
12 | 208311a80b4b74 |
13 | 95a9585a18486 |
14 | 3c4dd8582dcb6 |
15 | 1a6ad3c39661a |
hex | c83331a89c88 |
220122202021000 has 64 divisors (see below), whose sum is σ = 515489311986480. Its totient is φ = 87979930508800.
The previous prime is 220122202020997. The next prime is 220122202021067. The reversal of 220122202021000 is 120202221022.
It can be written as a sum of positive squares in 8 ways, for example, as 2190801636 + 220120011219364 = 46806^2 + 14836442^2 .
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, 84910237 + ... + 87464236.
Almost surely, 2220122202021000 is an apocalyptic number.
220122202021000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
220122202021000 is an abundant number, since it is smaller than the sum of its proper divisors (295367109965480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220122202021000 is a wasteful number, since it uses less digits than its factorization.
220122202021000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172375771 (or 172375757 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 220122202021000 its reverse (120202221022), we get a palindrome (220242404242022).
The spelling of 220122202021000 in words is "two hundred twenty trillion, one hundred twenty-two billion, two hundred two million, twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •