Base | Representation |
---|---|
bin | 101101011110011010011010… |
… | …000101011100001100110011 |
3 | 222020011000012111121200110221 |
4 | 231132122122011130030303 |
5 | 202203313130222114102 |
6 | 1545211355403033511 |
7 | 60061445543034136 |
oct | 5536323205341463 |
9 | 866130174550427 |
10 | 200002032223027 |
11 | 587aa427169611 |
12 | 1a521897b0b897 |
13 | 877a159309008 |
14 | 37562158aa21d |
15 | 181c7a26b9637 |
hex | b5e69a15c333 |
200002032223027 has 2 divisors, whose sum is σ = 200002032223028. Its totient is φ = 200002032223026.
The previous prime is 200002032222983. The next prime is 200002032223031. The reversal of 200002032223027 is 720322230200002.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200002032223027 - 211 = 200002032220979 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200002032222992 and 200002032223010.
It is not a weakly prime, because it can be changed into another prime (200002032223927) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100001016111513 + 100001016111514.
It is an arithmetic number, because the mean of its divisors is an integer number (100001016111514).
Almost surely, 2200002032223027 is an apocalyptic number.
200002032223027 is a deficient number, since it is larger than the sum of its proper divisors (1).
200002032223027 is an equidigital number, since it uses as much as digits as its factorization.
200002032223027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 25.
Adding to 200002032223027 its reverse (720322230200002), we get a palindrome (920324262423029).
The spelling of 200002032223027 in words is "two hundred trillion, two billion, thirty-two million, two hundred twenty-three thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •