Base | Representation |
---|---|
bin | 11101001001100010110… |
… | …110011111010011111101 |
3 | 21002111101101220100210010 |
4 | 131021202312133103331 |
5 | 230304333440224013 |
6 | 4132114551533433 |
7 | 264502004235246 |
oct | 35114266372375 |
9 | 7074341810703 |
10 | 2003113211133 |
11 | 702574206451 |
12 | 28427268a279 |
13 | 116b7b536738 |
14 | 6cd46125ccd |
15 | 3718b4857c3 |
hex | 1d262d9f4fd |
2003113211133 has 8 divisors (see below), whose sum is σ = 2691205536096. Its totient is φ = 1325214846800.
The previous prime is 2003113211119. The next prime is 2003113211161. The reversal of 2003113211133 is 3311123113002.
It is a happy number.
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 2003113211133 - 26 = 2003113211069 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2003113211173) 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, 2548489698 + ... + 2548490483.
It is an arithmetic number, because the mean of its divisors is an integer number (336400692012).
Almost surely, 22003113211133 is an apocalyptic number.
It is an amenable number.
2003113211133 is a deficient number, since it is larger than the sum of its proper divisors (688092324963).
2003113211133 is a wasteful number, since it uses less digits than its factorization.
2003113211133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5096980315.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 2003113211133 its reverse (3311123113002), we get a palindrome (5314236324135).
The spelling of 2003113211133 in words is "two trillion, three billion, one hundred thirteen million, two hundred eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •