Base | Representation |
---|---|
bin | 101101100010110001110010… |
… | …001110011110010100111001 |
3 | 222021012200111120000022001002 |
4 | 231202301302032132110321 |
5 | 202223222004332304423 |
6 | 1550001250145534345 |
7 | 60122225364263225 |
oct | 5542616216362471 |
9 | 867180446008032 |
10 | 200302011213113 |
11 | 58905673515847 |
12 | 1a56ba563443b5 |
13 | 879c52498c904 |
14 | 3766951cdd785 |
15 | 18254ad0c8228 |
hex | b62c7239e539 |
200302011213113 has 8 divisors (see below), whose sum is σ = 207130619302656. Its totient is φ = 193496356429200.
The previous prime is 200302011213061. The next prime is 200302011213121. The reversal of 200302011213113 is 311312110203002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200302011213113 - 28 = 200302011212857 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (200302011213173) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5738308658 + ... + 5738343563.
It is an arithmetic number, because the mean of its divisors is an integer number (25891327412832).
Almost surely, 2200302011213113 is an apocalyptic number.
It is an amenable number.
200302011213113 is a deficient number, since it is larger than the sum of its proper divisors (6828608089543).
200302011213113 is a wasteful number, since it uses less digits than its factorization.
200302011213113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11476652815.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 200302011213113 its reverse (311312110203002), we get a palindrome (511614121416115).
The spelling of 200302011213113 in words is "two hundred trillion, three hundred two billion, eleven million, two hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •