Base | Representation |
---|---|
bin | 11101001001101111001… |
… | …111001100001100100111 |
3 | 21002111220212220210101201 |
4 | 131021233033030030213 |
5 | 230310300134404111 |
6 | 4132151333503331 |
7 | 264510106435552 |
oct | 35115717141447 |
9 | 7074825823351 |
10 | 2003321013031 |
11 | 702670538058 |
12 | 2843101a1b47 |
13 | 116bb25c2c40 |
14 | 6cd65979699 |
15 | 3719e8316c1 |
hex | 1d26f3cc327 |
2003321013031 has 8 divisors (see below), whose sum is σ = 2215731349664. Its totient is φ = 1799240493600.
The previous prime is 2003321013013. The next prime is 2003321013073. The reversal of 2003321013031 is 1303101233002.
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 2003321013031 - 229 = 2002784142119 is a prime.
It is a super-2 number, since 2×20033210130312 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2003321013931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2082453795 + ... + 2082454756.
It is an arithmetic number, because the mean of its divisors is an integer number (276966418708).
Almost surely, 22003321013031 is an apocalyptic number.
2003321013031 is a deficient number, since it is larger than the sum of its proper divisors (212410336633).
2003321013031 is a wasteful number, since it uses less digits than its factorization.
2003321013031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4164908601.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 2003321013031 its reverse (1303101233002), we get a palindrome (3306422246033).
The spelling of 2003321013031 in words is "two trillion, three billion, three hundred twenty-one million, thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •