Base | Representation |
---|---|
bin | 11101001001100011010… |
… | …100001111110100111111 |
3 | 21002111101221120200121021 |
4 | 131021203110033310333 |
5 | 230304342434341111 |
6 | 4132115431045011 |
7 | 264502130445346 |
oct | 35114324176477 |
9 | 7074357520537 |
10 | 2003121012031 |
11 | 702578654377 |
12 | 284275210767 |
13 | 116b80038359 |
14 | 6cd47196b5d |
15 | 3718bec6d71 |
hex | 1d26350fd3f |
2003121012031 has 8 divisors (see below), whose sum is σ = 2012832511200. Its totient is φ = 1993424375808.
The previous prime is 2003121012023. The next prime is 2003121012043. The reversal of 2003121012031 is 1302101213002.
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 2003121012031 - 23 = 2003121012023 is a prime.
It is a super-2 number, since 2×20031210120312 (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 = 2003121011996 and 2003121012014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2003121012001) 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, 3445491 + ... + 3984676.
It is an arithmetic number, because the mean of its divisors is an integer number (251604063900).
Almost surely, 22003121012031 is an apocalyptic number.
2003121012031 is a deficient number, since it is larger than the sum of its proper divisors (9711499169).
2003121012031 is a wasteful number, since it uses less digits than its factorization.
2003121012031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7431473.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 2003121012031 its reverse (1302101213002), we get a palindrome (3305222225033).
The spelling of 2003121012031 in words is "two trillion, three billion, one hundred twenty-one million, twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •