Base | Representation |
---|---|
bin | 100000000011101110111… |
… | …000011010111000011011 |
3 | 21210121102000112110112110 |
4 | 200003232320122320123 |
5 | 242043301420220011 |
6 | 4404020344243403 |
7 | 315110106504141 |
oct | 40035670327033 |
9 | 7717360473473 |
10 | 2203031023131 |
11 | 77a333641584 |
12 | 2b6b66770563 |
13 | 12c98b80a653 |
14 | 788ad331591 |
15 | 3c48c5c2ba6 |
hex | 200eee1ae1b |
2203031023131 has 8 divisors (see below), whose sum is σ = 2937395254864. Its totient is φ = 1468677070080.
The previous prime is 2203031023117. The next prime is 2203031023189. The reversal of 2203031023131 is 1313201303022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2203031023131 - 27 = 2203031023003 is a prime.
It is a super-2 number, since 2×22030310231312 (a number of 25 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 = 2203031023098 and 2203031023107.
It is not an unprimeable number, because it can be changed into a prime (2203031023331) 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, 2054830 + ... + 2937411.
It is an arithmetic number, because the mean of its divisors is an integer number (367174406858).
Almost surely, 22203031023131 is an apocalyptic number.
2203031023131 is a deficient number, since it is larger than the sum of its proper divisors (734364231733).
2203031023131 is a wasteful number, since it uses less digits than its factorization.
2203031023131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5139341.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 2203031023131 its reverse (1313201303022), we get a palindrome (3516232326153).
The spelling of 2203031023131 in words is "two trillion, two hundred three billion, thirty-one million, twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •