Base | Representation |
---|---|
bin | 101101011110101110001000… |
… | …100000110010110110101100 |
3 | 222020020000212120120001010010 |
4 | 231132232020200302312230 |
5 | 202204140014313142200 |
6 | 1545225221204213220 |
7 | 60063125444151501 |
oct | 5536561040626654 |
9 | 866200776501103 |
10 | 200023212240300 |
11 | 58808405796019 |
12 | 1a525a0909a210 |
13 | 877c1532cc807 |
14 | 375726479d4a8 |
15 | 181d0e1d25150 |
hex | b5eb88832dac |
200023212240300 has 72 divisors (see below), whose sum is σ = 578812115157136. Its totient is φ = 53332307804160.
The previous prime is 200023212240223. The next prime is 200023212240307. The reversal of 200023212240300 is 3042212320002.
200023212240300 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (200023212240307) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 42875029 + ... + 47310828.
Almost surely, 2200023212240300 is an apocalyptic number.
200023212240300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200023212240300 is an abundant number, since it is smaller than the sum of its proper divisors (378788902916836).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200023212240300 is a wasteful number, since it uses less digits than its factorization.
200023212240300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90193267 (or 90193260 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 200023212240300 its reverse (3042212320002), we get a palindrome (203065424560302).
The spelling of 200023212240300 in words is "two hundred trillion, twenty-three billion, two hundred twelve million, two hundred forty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •