Base | Representation |
---|---|
bin | 101101100000000001111100… |
… | …100000000110011111010000 |
3 | 222020112122011022220012102021 |
4 | 231200001330200012133100 |
5 | 202212123320442421300 |
6 | 1545334423130301224 |
7 | 60102462525320206 |
oct | 5540017440063720 |
9 | 866478138805367 |
10 | 200113205045200 |
11 | 58842596342347 |
12 | 1a53b343587814 |
13 | 87877957a2b25 |
14 | 375b760747076 |
15 | 182060c72ed1a |
hex | b6007c8067d0 |
200113205045200 has 60 divisors (see below), whose sum is σ = 501675104497248. Its totient is φ = 76565052361600.
The previous prime is 200113205045161. The next prime is 200113205045233. The reversal of 200113205045200 is 2540502311002.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10875708466 + ... + 10875726865.
Almost surely, 2200113205045200 is an apocalyptic number.
200113205045200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200113205045200 is an abundant number, since it is smaller than the sum of its proper divisors (301561899452048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200113205045200 is a wasteful number, since it uses less digits than its factorization.
200113205045200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21751435372 (or 21751435361 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 200113205045200 its reverse (2540502311002), we get a palindrome (202653707356202).
The spelling of 200113205045200 in words is "two hundred trillion, one hundred thirteen billion, two hundred five million, forty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •