Base | Representation |
---|---|
bin | 111011100110101… |
… | …1100100000000001 |
3 | 12011101101012111011 |
4 | 1313031130200001 |
5 | 13044000411223 |
6 | 530243120521 |
7 | 100363555414 |
oct | 16715344001 |
9 | 5141335434 |
10 | 2000013313 |
11 | 936a56671 |
12 | 479973141 |
13 | 25b48043c |
14 | 14d89db7b |
15 | ba8b680d |
hex | 7735c801 |
2000013313 has 4 divisors (see below), whose sum is σ = 2000674900. Its totient is φ = 1999351728.
The previous prime is 2000013311. The next prime is 2000013341. The reversal of 2000013313 is 3133100002.
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 1157156289 + 842857024 = 34017^2 + 29032^2 .
It is a cyclic number.
It is not a de Polignac number, because 2000013313 - 21 = 2000013311 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2000013293 and 2000013302.
It is not an unprimeable number, because it can be changed into a prime (2000013311) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 326238 + ... + 332311.
It is an arithmetic number, because the mean of its divisors is an integer number (500168725).
Almost surely, 22000013313 is an apocalyptic number.
It is an amenable number.
2000013313 is a deficient number, since it is larger than the sum of its proper divisors (661587).
2000013313 is an equidigital number, since it uses as much as digits as its factorization.
2000013313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 661586.
The product of its (nonzero) digits is 54, while the sum is 13.
The square root of 2000013313 is about 44721.5083936130. The cubic root of 2000013313 is about 1259.9238454435.
Adding to 2000013313 its reverse (3133100002), we get a palindrome (5133113315).
The spelling of 2000013313 in words is "two billion, thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •