Base | Representation |
---|---|
bin | 11101000111100110000… |
… | …101100100010010111101 |
3 | 21002021222112011210222112 |
4 | 131013212011210102331 |
5 | 230241042110333314 |
6 | 4131131135223405 |
7 | 264366066314105 |
oct | 35074605442275 |
9 | 7067875153875 |
10 | 2001020011709 |
11 | 70169a6a2774 |
12 | 283989677b65 |
13 | 11690698a0b4 |
14 | 6cbc812a205 |
15 | 370b781343e |
hex | 1d1e61644bd |
2001020011709 has 2 divisors, whose sum is σ = 2001020011710. Its totient is φ = 2001020011708.
The previous prime is 2001020011691. The next prime is 2001020011729. The reversal of 2001020011709 is 9071100201002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1956789715609 + 44230296100 = 1398853^2 + 210310^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2001020011709 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2001020011729) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000510005854 + 1000510005855.
It is an arithmetic number, because the mean of its divisors is an integer number (1000510005855).
Almost surely, 22001020011709 is an apocalyptic number.
It is an amenable number.
2001020011709 is a deficient number, since it is larger than the sum of its proper divisors (1).
2001020011709 is an equidigital number, since it uses as much as digits as its factorization.
2001020011709 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 23.
The spelling of 2001020011709 in words is "two trillion, one billion, twenty million, eleven thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •