Base | Representation |
---|---|
bin | 101110001010001101000001… |
… | …001101000101101101010011 |
3 | 222121210200200110112220022022 |
4 | 232022031001031011231103 |
5 | 203102114132130132243 |
6 | 1555434035412402055 |
7 | 60522040406512055 |
oct | 5612150115055523 |
9 | 877720613486268 |
10 | 203011313130323 |
11 | 5975a68384a305 |
12 | 1a928b5201632b |
13 | 8937b66860829 |
14 | 381bb2b21b8d5 |
15 | 1870bcbac6b68 |
hex | b8a341345b53 |
203011313130323 has 8 divisors (see below), whose sum is σ = 207974203937136. Its totient is φ = 198048964960000.
The previous prime is 203011313130281. The next prime is 203011313130343. The reversal of 203011313130323 is 323031313110302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 203011313130323 - 238 = 202736435223379 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 203011313130292 and 203011313130301.
It is not an unprimeable number, because it can be changed into a prime (203011313130343) 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, 134901686 + ... + 136398267.
It is an arithmetic number, because the mean of its divisors is an integer number (25996775492142).
Almost surely, 2203011313130323 is an apocalyptic number.
203011313130323 is a deficient number, since it is larger than the sum of its proper divisors (4962890806813).
203011313130323 is a wasteful number, since it uses less digits than its factorization.
203011313130323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 271318245.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 203011313130323 its reverse (323031313110302), we get a palindrome (526042626240625).
The spelling of 203011313130323 in words is "two hundred three trillion, eleven billion, three hundred thirteen million, one hundred thirty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •