Base | Representation |
---|---|
bin | 101101011110100010111100… |
… | …100110011001010101110000 |
3 | 222020011212212111201002111111 |
4 | 231132202330212121111300 |
5 | 202203440420003101000 |
6 | 1545215513302323104 |
7 | 60062222010164440 |
oct | 5536427446312560 |
9 | 866155774632444 |
10 | 200011201222000 |
11 | 58803301899213 |
12 | 1a523616729494 |
13 | 877ac8aaaaaac |
14 | 3756845514120 |
15 | 181cb3c629cba |
hex | b5e8bc999570 |
200011201222000 has 80 divisors (see below), whose sum is σ = 552716668101312. Its totient is φ = 68575268985600.
The previous prime is 200011201221983. The next prime is 200011201222033. The reversal of 200011201222000 is 222102110002.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×2000112012220002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7143243187 + ... + 7143271186.
Almost surely, 2200011201222000 is an apocalyptic number.
200011201222000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200011201222000 is an abundant number, since it is smaller than the sum of its proper divisors (352705466879312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200011201222000 is a wasteful number, since it uses less digits than its factorization.
200011201222000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14286514403 (or 14286514387 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 200011201222000 its reverse (222102110002), we get a palindrome (200233303332002).
The spelling of 200011201222000 in words is "two hundred trillion, eleven billion, two hundred one million, two hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •