Base | Representation |
---|---|
bin | 111011100110111… |
… | …0001111010010101 |
3 | 12011101112122210022 |
4 | 1313031301322111 |
5 | 13044011213023 |
6 | 530245034525 |
7 | 100364402201 |
oct | 16715617225 |
9 | 5141478708 |
10 | 2000101013 |
11 | 937006549 |
12 | 4799b5a45 |
13 | 25b4b1331 |
14 | 14d8c3b01 |
15 | ba8d27c8 |
hex | 77371e95 |
2000101013 has 4 divisors (see below), whose sum is σ = 2000309088. Its totient is φ = 1999892940.
The previous prime is 2000100979. The next prime is 2000101021. The reversal of 2000101013 is 3101010002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2000101013 - 228 = 1731665557 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000101093) 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 3 ways as a sum of consecutive naturals, for example, 88883 + ... + 109088.
It is an arithmetic number, because the mean of its divisors is an integer number (500077272).
Almost surely, 22000101013 is an apocalyptic number.
It is an amenable number.
2000101013 is a deficient number, since it is larger than the sum of its proper divisors (208075).
2000101013 is a wasteful number, since it uses less digits than its factorization.
2000101013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208074.
The product of its (nonzero) digits is 6, while the sum is 8.
The square root of 2000101013 is about 44722.4888954092. The cubic root of 2000101013 is about 1259.9422609386.
Adding to 2000101013 its reverse (3101010002), we get a palindrome (5101111015).
The spelling of 2000101013 in words is "two billion, one hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •