Base | Representation |
---|---|
bin | 11101001001101110110… |
… | …001000000010011100011 |
3 | 21002111220100000202202121 |
4 | 131021232301000103203 |
5 | 230310241123200003 |
6 | 4132150452125111 |
7 | 264506652250525 |
oct | 35115661002343 |
9 | 7074810022677 |
10 | 2003313100003 |
11 | 702667022966 |
12 | 284309606797 |
13 | 116bb0a82287 |
14 | 6cd648b9a15 |
15 | 3719dcbbcbd |
hex | 1d26ec404e3 |
2003313100003 has 8 divisors (see below), whose sum is σ = 2121197820480. Its totient is φ = 1885433132160.
The previous prime is 2003313099979. The next prime is 2003313100031. The reversal of 2003313100003 is 3000013133002.
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 2003313100003 - 217 = 2003312968931 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2003313100003.
It is not an unprimeable number, because it can be changed into a prime (2003313100073) 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 7 ways as a sum of consecutive naturals, for example, 301408 + ... + 2024221.
It is an arithmetic number, because the mean of its divisors is an integer number (265149727560).
Almost surely, 22003313100003 is an apocalyptic number.
2003313100003 is a deficient number, since it is larger than the sum of its proper divisors (117884720477).
2003313100003 is a wasteful number, since it uses less digits than its factorization.
2003313100003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2376317.
The product of its (nonzero) digits is 162, while the sum is 16.
Adding to 2003313100003 its reverse (3000013133002), we get a palindrome (5003326233005).
The spelling of 2003313100003 in words is "two trillion, three billion, three hundred thirteen million, one hundred thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •