Base | Representation |
---|---|
bin | 101101011110011010011000… |
… | …001110110000100000010111 |
3 | 222020011000010100002000212222 |
4 | 231132122120032300200113 |
5 | 202203313044241023223 |
6 | 1545211352332132555 |
7 | 60061445014424534 |
oct | 5536323016604027 |
9 | 866130110060788 |
10 | 200002001111063 |
11 | 587aa410649748 |
12 | 1a52188960715b |
13 | 877a152a34b78 |
14 | 37562116cbd8b |
15 | 181c79eac10c8 |
hex | b5e6983b0817 |
200002001111063 has 2 divisors, whose sum is σ = 200002001111064. Its totient is φ = 200002001111062.
The previous prime is 200002001111053. The next prime is 200002001111123. The reversal of 200002001111063 is 360111100200002.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200002001111063 - 210 = 200002001110039 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200002001111053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100001000555531 + 100001000555532.
It is an arithmetic number, because the mean of its divisors is an integer number (100001000555532).
Almost surely, 2200002001111063 is an apocalyptic number.
200002001111063 is a deficient number, since it is larger than the sum of its proper divisors (1).
200002001111063 is an equidigital number, since it uses as much as digits as its factorization.
200002001111063 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 200002001111063 its reverse (360111100200002), we get a palindrome (560113101311065).
The spelling of 200002001111063 in words is "two hundred trillion, two billion, one million, one hundred eleven thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •