Base | Representation |
---|---|
bin | 101101100001011110000100… |
… | …010010101111110100010000 |
3 | 222020220002110212212001012002 |
4 | 231201132010102233310100 |
5 | 202220233410210310000 |
6 | 1545452102253253132 |
7 | 60112563655540610 |
oct | 5541360422576420 |
9 | 866802425761162 |
10 | 200212120010000 |
11 | 5888053525443a |
12 | 1a556549a941a8 |
13 | 8793bca5711b7 |
14 | 3762465642a40 |
15 | 1822e9b58c8d5 |
hex | b617844afd10 |
200212120010000 has 800 divisors, whose sum is σ = 598442387735808. Its totient is φ = 63301754880000.
The previous prime is 200212120009999. The next prime is 200212120010057. The reversal of 200212120010000 is 10021212002.
It is a happy number.
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 60105708335 + ... + 60105711665.
Almost surely, 2200212120010000 is an apocalyptic number.
200212120010000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 200212120010000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (299221193867904).
200212120010000 is an abundant number, since it is smaller than the sum of its proper divisors (398230267725808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200212120010000 is a wasteful number, since it uses less digits than its factorization.
200212120010000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4389 (or 4368 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 200212120010000 its reverse (10021212002), we get a palindrome (200222141222002).
The spelling of 200212120010000 in words is "two hundred trillion, two hundred twelve billion, one hundred twenty million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •