Base | Representation |
---|---|
bin | 101101011110101101000000… |
… | …111010100000101010111100 |
3 | 222020012220202212020211101220 |
4 | 231132231000322200222330 |
5 | 202204130034310201022 |
6 | 1545224502054033340 |
7 | 60063053620030404 |
oct | 5536550072405274 |
9 | 866186685224356 |
10 | 200022011022012 |
11 | 58807949727a33 |
12 | 1a525732948850 |
13 | 877bcc149c96a |
14 | 375718d033804 |
15 | 181d07164885c |
hex | b5eb40ea0abc |
200022011022012 has 24 divisors (see below), whose sum is σ = 466725789605376. Its totient is φ = 66672894547248.
The previous prime is 200022011021993. The next prime is 200022011022059. The reversal of 200022011022012 is 210220110220002.
200022011022012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 200022011021982 and 200022011022000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 137889258 + ... + 139332305.
It is an arithmetic number, because the mean of its divisors is an integer number (19446907900224).
Almost surely, 2200022011022012 is an apocalyptic number.
It is an amenable number.
200022011022012 is an abundant number, since it is smaller than the sum of its proper divisors (266703778583364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200022011022012 is a wasteful number, since it uses less digits than its factorization.
200022011022012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 277281697 (or 277281695 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 200022011022012 its reverse (210220110220002), we get a palindrome (410242121242014).
The spelling of 200022011022012 in words is "two hundred trillion, twenty-two billion, eleven million, twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •