Base | Representation |
---|---|
bin | 111011101100011… |
… | …1111011100001101 |
3 | 12011121001222100011 |
4 | 1313120333130031 |
5 | 13100234240023 |
6 | 530432033221 |
7 | 100431362542 |
oct | 16730773415 |
9 | 5147058304 |
10 | 2003040013 |
11 | 938733677 |
12 | 47a992811 |
13 | 25bc9cca0 |
14 | 15004abc9 |
15 | bacb350d |
hex | 7763f70d |
2003040013 has 8 divisors (see below), whose sum is σ = 2157478400. Its totient is φ = 1848652848.
The previous prime is 2003039999. The next prime is 2003040019. The reversal of 2003040013 is 3100403002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2003040013 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2003039975 and 2003040002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2003040019) 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, 117868 + ... + 133786.
It is an arithmetic number, because the mean of its divisors is an integer number (269684800).
Almost surely, 22003040013 is an apocalyptic number.
It is an amenable number.
2003040013 is a deficient number, since it is larger than the sum of its proper divisors (154438387).
2003040013 is a wasteful number, since it uses less digits than its factorization.
2003040013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25611.
The product of its (nonzero) digits is 72, while the sum is 13.
The square root of 2003040013 is about 44755.3350227657. The cubic root of 2003040013 is about 1260.5590894577.
Adding to 2003040013 its reverse (3100403002), we get a palindrome (5103443015).
The spelling of 2003040013 in words is "two billion, three million, forty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •