Base | Representation |
---|---|
bin | 1011101010001011100… |
… | …0011111010110111001 |
3 | 201011000100001220012122 |
4 | 2322202320133112321 |
5 | 11240204102304423 |
6 | 232003410051025 |
7 | 20320436135231 |
oct | 2724270372671 |
9 | 634010056178 |
10 | 200301213113 |
11 | 77a468a4061 |
12 | 329a0579a75 |
13 | 15b718531a1 |
14 | 99a20cccc1 |
15 | 5324b228c8 |
hex | 2ea2e1f5b9 |
200301213113 has 4 divisors (see below), whose sum is σ = 200776988388. Its totient is φ = 199825437840.
The previous prime is 200301213089. The next prime is 200301213127. The reversal of 200301213113 is 311312103002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 41238237184 + 159062975929 = 203072^2 + 398827^2 .
It is a cyclic number.
It is not a de Polignac number, because 200301213113 - 216 = 200301147577 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200301213091 and 200301213100.
It is not an unprimeable number, because it can be changed into a prime (200301213313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 237887006 + ... + 237887847.
It is an arithmetic number, because the mean of its divisors is an integer number (50194247097).
Almost surely, 2200301213113 is an apocalyptic number.
It is an amenable number.
200301213113 is a deficient number, since it is larger than the sum of its proper divisors (475775275).
200301213113 is an equidigital number, since it uses as much as digits as its factorization.
200301213113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 475775274.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 200301213113 its reverse (311312103002), we get a palindrome (511613316115).
The spelling of 200301213113 in words is "two hundred billion, three hundred one million, two hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •