Base | Representation |
---|---|
bin | 111011111111011… |
… | …1111111000110001 |
3 | 12012021211011102021 |
4 | 1313332333320301 |
5 | 13110312101223 |
6 | 531425351441 |
7 | 100612150216 |
oct | 16776777061 |
9 | 5167734367 |
10 | 2013003313 |
11 | 943319202 |
12 | 482198581 |
13 | 26107ac29 |
14 | 1514c1b0d |
15 | bbad065d |
hex | 77fbfe31 |
2013003313 has 4 divisors (see below), whose sum is σ = 2013135460. Its totient is φ = 2012871168.
The previous prime is 2013003301. The next prime is 2013003341. The reversal of 2013003313 is 3133003102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 901981089 + 1111022224 = 30033^2 + 33332^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2013003313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2013003413) 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 3 ways as a sum of consecutive naturals, for example, 39720 + ... + 74857.
It is an arithmetic number, because the mean of its divisors is an integer number (503283865).
Almost surely, 22013003313 is an apocalyptic number.
It is an amenable number.
2013003313 is a deficient number, since it is larger than the sum of its proper divisors (132147).
2013003313 is a wasteful number, since it uses less digits than its factorization.
2013003313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132146.
The product of its (nonzero) digits is 162, while the sum is 16.
The square root of 2013003313 is about 44866.5054690022. The cubic root of 2013003313 is about 1262.6456781608.
Adding to 2013003313 its reverse (3133003102), we get a palindrome (5146006415).
The spelling of 2013003313 in words is "two billion, thirteen million, three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •