Base | Representation |
---|---|
bin | 1011110100111110101… |
… | …1101101001001110001 |
3 | 201102111101020210100222 |
4 | 2331033223231021301 |
5 | 11312123240220423 |
6 | 233203212022425 |
7 | 20452331136230 |
oct | 2751753551161 |
9 | 642441223328 |
10 | 203200320113 |
11 | 791a431305a |
12 | 3346b461a15 |
13 | 1621437060b |
14 | 9b99150b17 |
15 | 54443d73c8 |
hex | 2f4faed271 |
203200320113 has 8 divisors (see below), whose sum is σ = 232255770432. Its totient is φ = 174151578096.
The previous prime is 203200320109. The next prime is 203200320137. The reversal of 203200320113 is 311023002302.
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 203200320113 - 22 = 203200320109 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 203200320091 and 203200320100.
It is not an unprimeable number, because it can be changed into a prime (203200322113) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1611995 + ... + 1733472.
It is an arithmetic number, because the mean of its divisors is an integer number (29031971304).
Almost surely, 2203200320113 is an apocalyptic number.
It is an amenable number.
203200320113 is a deficient number, since it is larger than the sum of its proper divisors (29055450319).
203200320113 is an equidigital number, since it uses as much as digits as its factorization.
203200320113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3354151.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 203200320113 its reverse (311023002302), we get a palindrome (514223322415).
The spelling of 203200320113 in words is "two hundred three billion, two hundred million, three hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •