Base | Representation |
---|---|
bin | 11101011010011000111… |
… | …010001100001010010000 |
3 | 21011020001220102110100011 |
4 | 131122120322030022100 |
5 | 231103404201120422 |
6 | 4144305415004304 |
7 | 266012135462620 |
oct | 35323072141220 |
9 | 7136056373304 |
10 | 2021200020112 |
11 | 70a20579a769 |
12 | 28787b969694 |
13 | 1187a173c680 |
14 | 6db802ac880 |
15 | 3789928a077 |
hex | 1d698e8c290 |
2021200020112 has 160 divisors (see below), whose sum is σ = 5046530001408. Its totient is φ = 762216542208.
The previous prime is 2021200020083. The next prime is 2021200020139. The reversal of 2021200020112 is 2110200021202.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 2021200020092 and 2021200020101.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9708988 + ... + 9914980.
Almost surely, 22021200020112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2021200020112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2523265000704).
2021200020112 is an abundant number, since it is smaller than the sum of its proper divisors (3025329981296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2021200020112 is a wasteful number, since it uses less digits than its factorization.
2021200020112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 206337 (or 206331 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 2021200020112 its reverse (2110200021202), we get a palindrome (4131400041314).
The spelling of 2021200020112 in words is "two trillion, twenty-one billion, two hundred million, twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •