Base | Representation |
---|---|
bin | 101101100010110001110001… |
… | …101011110000101100010100 |
3 | 222021012200110220212222102222 |
4 | 231202301301223300230110 |
5 | 202223222000020111200 |
6 | 1550001245222521512 |
7 | 60122225224033163 |
oct | 5542616153605424 |
9 | 867180426788388 |
10 | 200302002113300 |
11 | 5890566936aa3a |
12 | 1a56ba53296298 |
13 | 879c522b249c9 |
14 | 3766950a113da |
15 | 18254ac3cbd85 |
hex | b62c71af0b14 |
200302002113300 has 36 divisors (see below), whose sum is σ = 434655965612736. Its totient is φ = 80120686370400.
The previous prime is 200302002113263. The next prime is 200302002113329. The reversal of 200302002113300 is 3311200203002.
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 11 ways as a sum of consecutive naturals, for example, 121163285 + ... + 122805315.
It is an arithmetic number, because the mean of its divisors is an integer number (12073776822576).
Almost surely, 2200302002113300 is an apocalyptic number.
200302002113300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200302002113300 is an abundant number, since it is smaller than the sum of its proper divisors (234353963499436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200302002113300 is a wasteful number, since it uses less digits than its factorization.
200302002113300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2861888 (or 2861881 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 200302002113300 its reverse (3311200203002), we get a palindrome (203613202316302).
The spelling of 200302002113300 in words is "two hundred trillion, three hundred two billion, two million, one hundred thirteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •