Base | Representation |
---|---|
bin | 11101001001100101010… |
… | …110000010000001110111 |
3 | 21002111111022121012021202 |
4 | 131021211112002001313 |
5 | 230304430142043411 |
6 | 4132123044203115 |
7 | 264503022565421 |
oct | 35114526020167 |
9 | 7074438535252 |
10 | 2003155034231 |
11 | 70259588179a |
12 | 28428469949b |
13 | 116b870bb030 |
14 | 6cd4b8d1811 |
15 | 3718ee9783b |
hex | 1d265582077 |
2003155034231 has 16 divisors (see below), whose sum is σ = 2164825506144. Its totient is φ = 1842579062784.
The previous prime is 2003155034227. The next prime is 2003155034239. The reversal of 2003155034231 is 1324305513002.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 2003155034231 - 22 = 2003155034227 is a prime.
It is a super-2 number, since 2×20031550342312 (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 = 2003155034194 and 2003155034203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2003155034239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3985895 + ... + 4460231.
It is an arithmetic number, because the mean of its divisors is an integer number (135301594134).
Almost surely, 22003155034231 is an apocalyptic number.
2003155034231 is a deficient number, since it is larger than the sum of its proper divisors (161670471913).
2003155034231 is a wasteful number, since it uses less digits than its factorization.
2003155034231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 475490.
The product of its (nonzero) digits is 10800, while the sum is 29.
The spelling of 2003155034231 in words is "two trillion, three billion, one hundred fifty-five million, thirty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •