Base | Representation |
---|---|
bin | 101101100001010101101011… |
… | …110111010000000100011100 |
3 | 222020212020020200011001102102 |
4 | 231201111223313100010130 |
5 | 202220111442233324200 |
6 | 1545444013240344232 |
7 | 60112124644540310 |
oct | 5541255367200434 |
9 | 866766220131372 |
10 | 200203120214300 |
11 | 58877737092755 |
12 | 1a554857a75078 |
13 | 87930c4b62bb8 |
14 | 3761c50281b40 |
15 | 1822b214016d5 |
hex | b6156bdd011c |
200203120214300 has 72 divisors (see below), whose sum is σ = 500127853247904. Its totient is φ = 68140040048640.
The previous prime is 200203120214287. The next prime is 200203120214323. The reversal of 200203120214300 is 3412021302002.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1043715989 + ... + 1043907788.
Almost surely, 2200203120214300 is an apocalyptic number.
200203120214300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200203120214300 is an abundant number, since it is smaller than the sum of its proper divisors (299924733033604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200203120214300 is a wasteful number, since it uses less digits than its factorization.
200203120214300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2087623935 (or 2087623928 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 200203120214300 its reverse (3412021302002), we get a palindrome (203615141516302).
The spelling of 200203120214300 in words is "two hundred trillion, two hundred three billion, one hundred twenty million, two hundred fourteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •