Base | Representation |
---|---|
bin | 111011100110101… |
… | …1110001101010011 |
3 | 12011101101120002012 |
4 | 1313031132031103 |
5 | 13044001122212 |
6 | 530243213135 |
7 | 100363614665 |
oct | 16715361523 |
9 | 5141346065 |
10 | 2000020307 |
11 | 936a6094a |
12 | 4799771ab |
13 | 25b48368c |
14 | 14d8a2535 |
15 | ba8b8922 |
hex | 7735e353 |
2000020307 has 4 divisors (see below), whose sum is σ = 2000109816. Its totient is φ = 1999930800.
The previous prime is 2000020279. The next prime is 2000020339. The reversal of 2000020307 is 7030200002.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 2000020307 - 228 = 1731584851 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2000020291 and 2000020300.
It is not an unprimeable number, because it can be changed into a prime (2000020367) 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, 19823 + ... + 66279.
It is an arithmetic number, because the mean of its divisors is an integer number (500027454).
Almost surely, 22000020307 is an apocalyptic number.
2000020307 is a deficient number, since it is larger than the sum of its proper divisors (89509).
2000020307 is an equidigital number, since it uses as much as digits as its factorization.
2000020307 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89508.
The product of its (nonzero) digits is 84, while the sum is 14.
The square root of 2000020307 is about 44721.5865885816. The cubic root of 2000020307 is about 1259.9253140832.
Adding to 2000020307 its reverse (7030200002), we get a palindrome (9030220309).
The spelling of 2000020307 in words is "two billion, twenty thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •