Base | Representation |
---|---|
bin | 111011100111000… |
… | …1110010000101101 |
3 | 12011101202120002001 |
4 | 1313032032100231 |
5 | 13044023422013 |
6 | 530251332301 |
7 | 100365364555 |
oct | 16716162055 |
9 | 5141676061 |
10 | 2000217133 |
11 | 937085812 |
12 | 479a51091 |
13 | 25b522145 |
14 | 14d914165 |
15 | ba906ddd |
hex | 7738e42d |
2000217133 has 2 divisors, whose sum is σ = 2000217134. Its totient is φ = 2000217132.
The previous prime is 2000217113. The next prime is 2000217137. The reversal of 2000217133 is 3317120002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1874283849 + 125933284 = 43293^2 + 11222^2 .
It is a cyclic number.
It is not a de Polignac number, because 2000217133 - 25 = 2000217101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2000217133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2000217137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000108566 + 1000108567.
It is an arithmetic number, because the mean of its divisors is an integer number (1000108567).
Almost surely, 22000217133 is an apocalyptic number.
It is an amenable number.
2000217133 is a deficient number, since it is larger than the sum of its proper divisors (1).
2000217133 is an equidigital number, since it uses as much as digits as its factorization.
2000217133 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 19.
The square root of 2000217133 is about 44723.7871048506. The cubic root of 2000217133 is about 1259.9666433178.
Adding to 2000217133 its reverse (3317120002), we get a palindrome (5317337135).
The spelling of 2000217133 in words is "two billion, two hundred seventeen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •