Base | Representation |
---|---|
bin | 101101011110101100001010… |
… | …101011110110110111101000 |
3 | 222020012211102110021122110220 |
4 | 231132230022223312313220 |
5 | 202204121203402223422 |
6 | 1545224231513410040 |
7 | 60063022231540446 |
oct | 5536541253666750 |
9 | 866184373248426 |
10 | 200021101211112 |
11 | 588075221045a5 |
12 | 1a52551a109920 |
13 | 877bba7b4c80c |
14 | 3757104281b96 |
15 | 181d01b82ee5c |
hex | b5eb0aaf6de8 |
200021101211112 has 16 divisors (see below), whose sum is σ = 500052753027840. Its totient is φ = 66673700403696.
The previous prime is 200021101211101. The next prime is 200021101211117. The reversal of 200021101211112 is 211112101120002.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 200021101211091 and 200021101211100.
It is not an unprimeable number, because it can be changed into a prime (200021101211117) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4167106275208 + ... + 4167106275255.
It is an arithmetic number, because the mean of its divisors is an integer number (31253297064240).
Almost surely, 2200021101211112 is an apocalyptic number.
It is an amenable number.
200021101211112 is an abundant number, since it is smaller than the sum of its proper divisors (300031651816728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200021101211112 is a wasteful number, since it uses less digits than its factorization.
200021101211112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8334212550472 (or 8334212550468 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 200021101211112 its reverse (211112101120002), we get a palindrome (411133202331114).
The spelling of 200021101211112 in words is "two hundred trillion, twenty-one billion, one hundred one million, two hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.943 sec. • engine limits •