Base | Representation |
---|---|
bin | 11101000111000001011… |
… | …00100110001111000001 |
3 | 10112121200210220020201222 |
4 | 32203200230212033001 |
5 | 112341403230400001 |
6 | 2043253032204425 |
7 | 132155641265264 |
oct | 16434054461701 |
9 | 3477623806658 |
10 | 1000202200001 |
11 | 356202080834 |
12 | 141a19839715 |
13 | 7341b143304 |
14 | 365a523ccdb |
15 | 1b03e3a761b |
hex | e8e0b263c1 |
1000202200001 has 2 divisors, whose sum is σ = 1000202200002. Its totient is φ = 1000202200000.
The previous prime is 1000202199991. The next prime is 1000202200009. The reversal of 1000202200001 is 1000022020001.
It is an a-pointer prime, because the next prime (1000202200009) can be obtained adding 1000202200001 to its sum of digits (8).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 890760327601 + 109441872400 = 943801^2 + 330820^2 .
It is an emirp because it is prime and its reverse (1000022020001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1000202200001 - 210 = 1000202198977 is a prime.
It is not a weakly prime, because it can be changed into another prime (1000202200009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500101100000 + 500101100001.
It is an arithmetic number, because the mean of its divisors is an integer number (500101100001).
Almost surely, 21000202200001 is an apocalyptic number.
It is an amenable number.
1000202200001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000202200001 is an equidigital number, since it uses as much as digits as its factorization.
1000202200001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 1000202200001 its reverse (1000022020001), we get a palindrome (2000224220002).
The spelling of 1000202200001 in words is "one trillion, two hundred two million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •