Base | Representation |
---|---|
bin | 1001001100100000110000… |
… | …01100101111000010000000 |
3 | 2122121010020001201222121022 |
4 | 10212100120030233002000 |
5 | 10122300314134133440 |
6 | 111001241200045012 |
7 | 4154633002133603 |
oct | 446203014570200 |
9 | 78533201658538 |
10 | 20221112021120 |
11 | 64967a863317a |
12 | 2326ba1603768 |
13 | b38ac54a9caa |
14 | 4dc9c81b233a |
15 | 250ee69d3cb5 |
hex | 12641832f080 |
20221112021120 has 32 divisors (see below), whose sum is σ = 48341095927020. Its totient is φ = 8088444808192.
The previous prime is 20221112021113. The next prime is 20221112021141. The reversal of 20221112021120 is 2112021112202.
It can be written as a sum of positive squares in 2 ways, for example, as 20122832279104 + 98279742016 = 4485848^2 + 313496^2 .
It is a tau number, because it is divible by the number of its divisors (32).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15797743127 + ... + 15797744406.
Almost surely, 220221112021120 is an apocalyptic number.
20221112021120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20221112021120 is an abundant number, since it is smaller than the sum of its proper divisors (28119983905900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20221112021120 is an equidigital number, since it uses as much as digits as its factorization.
20221112021120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31595487552 (or 31595487540 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 20221112021120 its reverse (2112021112202), we get a palindrome (22333133133322).
The spelling of 20221112021120 in words is "twenty trillion, two hundred twenty-one billion, one hundred twelve million, twenty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.233 sec. • engine limits •