Base | Representation |
---|---|
bin | 101101011110011001101000… |
… | …100010111101010101001110 |
3 | 222020010221001120201021011200 |
4 | 231132121220202331111032 |
5 | 202203304424440200420 |
6 | 1545211141113130330 |
7 | 60061416131434224 |
oct | 5536315042752516 |
9 | 866127046637150 |
10 | 200001201100110 |
11 | 587aa040000673 |
12 | 1a5216a56b99a6 |
13 | 877a056079cc7 |
14 | 375617735cb14 |
15 | 181c754745b90 |
hex | b5e6688bd54e |
200001201100110 has 24 divisors (see below), whose sum is σ = 520003122860520. Its totient is φ = 53333653626672.
The previous prime is 200001201100067. The next prime is 200001201100171. The reversal of 200001201100110 is 11001102100002.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 200001201100092 and 200001201100101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1111117783800 + ... + 1111117783979.
It is an arithmetic number, because the mean of its divisors is an integer number (21666796785855).
Almost surely, 2200001201100110 is an apocalyptic number.
200001201100110 is an abundant number, since it is smaller than the sum of its proper divisors (320001921760410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200001201100110 is a wasteful number, since it uses less digits than its factorization.
200001201100110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2222235567792 (or 2222235567789 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 200001201100110 its reverse (11001102100002), we get a palindrome (211002303200112).
The spelling of 200001201100110 in words is "two hundred trillion, one billion, two hundred one million, one hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •