Base | Representation |
---|---|
bin | 1011110100010001101… |
… | …0101100111010110011 |
3 | 201102000012121020210210 |
4 | 2331010122230322303 |
5 | 11311231344011311 |
6 | 233132340555203 |
7 | 20444544456111 |
oct | 2750432547263 |
9 | 642005536723 |
10 | 203011313331 |
11 | 79107659502 |
12 | 334180b2b03 |
13 | 161b4164c98 |
14 | 9b7bdd0ab1 |
15 | 5432a003a6 |
hex | 2f446aceb3 |
203011313331 has 8 divisors (see below), whose sum is σ = 271237567744. Its totient is φ = 135062967240.
The previous prime is 203011313321. The next prime is 203011313359. The reversal of 203011313331 is 133313110302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 203011313331 - 25 = 203011313299 is a prime.
It is a super-3 number, since 3×2030113133313 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 203011313298 and 203011313307.
It is not an unprimeable number, because it can be changed into a prime (203011313321) 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, 69475375 + ... + 69478296.
It is an arithmetic number, because the mean of its divisors is an integer number (33904695968).
Almost surely, 2203011313331 is an apocalyptic number.
203011313331 is a deficient number, since it is larger than the sum of its proper divisors (68226254413).
203011313331 is a wasteful number, since it uses less digits than its factorization.
203011313331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138954161.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 203011313331 its reverse (133313110302), we get a palindrome (336324423633).
The spelling of 203011313331 in words is "two hundred three billion, eleven million, three hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •