Base | Representation |
---|---|
bin | 11101001001100011111… |
… | …110100101100100001001 |
3 | 21002111102201110120200101 |
4 | 131021203332211210021 |
5 | 230304403310023423 |
6 | 4132120505005401 |
7 | 264502324003240 |
oct | 35114376454411 |
9 | 7074381416611 |
10 | 2003132111113 |
11 | 702583945271 |
12 | 284278a83861 |
13 | 116b82423263 |
14 | 6cd48845957 |
15 | 3718ce6a7ad |
hex | 1d263fa5909 |
2003132111113 has 8 divisors (see below), whose sum is σ = 2289323560832. Its totient is φ = 1716948091296.
The previous prime is 2003132111107. The next prime is 2003132111147. The reversal of 2003132111113 is 3111112313002.
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 2003132111113 - 29 = 2003132110601 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2003132111173) 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, 1267245 + ... + 2369002.
It is an arithmetic number, because the mean of its divisors is an integer number (286165445104).
Almost surely, 22003132111113 is an apocalyptic number.
It is an amenable number.
2003132111113 is a deficient number, since it is larger than the sum of its proper divisors (286191449719).
2003132111113 is an equidigital number, since it uses as much as digits as its factorization.
2003132111113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3714951.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 2003132111113 its reverse (3111112313002), we get a palindrome (5114244424115).
The spelling of 2003132111113 in words is "two trillion, three billion, one hundred thirty-two million, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •