Base | Representation |
---|---|
bin | 11101001001100100001… |
… | …010001011111110100011 |
3 | 21002111102221012002001010 |
4 | 131021210022023332203 |
5 | 230304410044331120 |
6 | 4132121054112003 |
7 | 264502361600013 |
oct | 35114412137643 |
9 | 7074387162033 |
10 | 2003135152035 |
11 | 702585631a26 |
12 | 284279aab603 |
13 | 116b82c49414 |
14 | 6cd48dd7c43 |
15 | 3718d36b7e0 |
hex | 1d26428bfa3 |
2003135152035 has 16 divisors (see below), whose sum is σ = 3245586071040. Its totient is φ = 1054815471840.
The previous prime is 2003135152021. The next prime is 2003135152111. The reversal of 2003135152035 is 5302515313002.
It is not a de Polignac number, because 2003135152035 - 27 = 2003135151907 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2003135151993 and 2003135152011.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 845203521 + ... + 845205890.
It is an arithmetic number, because the mean of its divisors is an integer number (202849129440).
Almost surely, 22003135152035 is an apocalyptic number.
2003135152035 is a deficient number, since it is larger than the sum of its proper divisors (1242450919005).
2003135152035 is a wasteful number, since it uses less digits than its factorization.
2003135152035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1690409498.
The product of its (nonzero) digits is 13500, while the sum is 30.
The spelling of 2003135152035 in words is "two trillion, three billion, one hundred thirty-five million, one hundred fifty-two thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •