Base | Representation |
---|---|
bin | 11101000111000001010… |
… | …00000001110011101001 |
3 | 10112121200201122101200121 |
4 | 32203200220001303221 |
5 | 112341402424032332 |
6 | 2043252550403241 |
7 | 132155625146224 |
oct | 16434050016351 |
9 | 3477621571617 |
10 | 1000201002217 |
11 | 35620143292a |
12 | 141a19360521 |
13 | 7341ab14071 |
14 | 365a500a5bb |
15 | 1b03e21c797 |
hex | e8e0a01ce9 |
1000201002217 has 2 divisors, whose sum is σ = 1000201002218. Its totient is φ = 1000201002216.
The previous prime is 1000201002197. The next prime is 1000201002221. The reversal of 1000201002217 is 7122001020001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 866870861481 + 133330140736 = 931059^2 + 365144^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1000201002217 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1000201002217.
It is not a weakly prime, because it can be changed into another prime (1000201002287) 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, 500100501108 + 500100501109.
It is an arithmetic number, because the mean of its divisors is an integer number (500100501109).
Almost surely, 21000201002217 is an apocalyptic number.
It is an amenable number.
1000201002217 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000201002217 is an equidigital number, since it uses as much as digits as its factorization.
1000201002217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 16.
Adding to 1000201002217 its reverse (7122001020001), we get a palindrome (8122202022218).
The spelling of 1000201002217 in words is "one trillion, two hundred one million, two thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •