Base | Representation |
---|---|
bin | 1011110101011101111… |
… | …1011001010110110111 |
3 | 201102211111201211010110 |
4 | 2331113133121112313 |
5 | 11312410303423111 |
6 | 233224211354103 |
7 | 20455511425032 |
oct | 2752737312667 |
9 | 642744654113 |
10 | 203331311031 |
11 | 79261251512 |
12 | 334a72b2933 |
13 | 16235545134 |
14 | 9bac6cc019 |
15 | 5450b5e5a6 |
hex | 2f577d95b7 |
203331311031 has 8 divisors (see below), whose sum is σ = 285377278720. Its totient is φ = 128419775352.
The previous prime is 203331311017. The next prime is 203331311039. The reversal of 203331311031 is 130113133302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-203331311031 is a prime.
It is a super-2 number, since 2×2033313110312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 203331310989 and 203331311007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203331311039) 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, 1783607935 + ... + 1783608048.
It is an arithmetic number, because the mean of its divisors is an integer number (35672159840).
Almost surely, 2203331311031 is an apocalyptic number.
203331311031 is a deficient number, since it is larger than the sum of its proper divisors (82045967689).
203331311031 is a wasteful number, since it uses less digits than its factorization.
203331311031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3567216005.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 203331311031 its reverse (130113133302), we get a palindrome (333444444333).
The spelling of 203331311031 in words is "two hundred three billion, three hundred thirty-one million, three hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •