Base | Representation |
---|---|
bin | 101101011110101011010110… |
… | …010010000000100110100001 |
3 | 222020012202011011221010000011 |
4 | 231132223112102000212201 |
5 | 202204112403314120001 |
6 | 1545224004345324521 |
7 | 60062661364540165 |
oct | 5536532622004641 |
9 | 866182134833004 |
10 | 200020222020001 |
11 | 588071108a5279 |
12 | 1a525313796741 |
13 | 877ba979607a6 |
14 | 375705d5c0ca5 |
15 | 181ceb9563d51 |
hex | b5ead64809a1 |
200020222020001 has 2 divisors, whose sum is σ = 200020222020002. Its totient is φ = 200020222020000.
The previous prime is 200020222019993. The next prime is 200020222020013. The reversal of 200020222020001 is 100020222020002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 177688926660001 + 22331295360000 = 13330001^2 + 4725600^2 .
It is a cyclic number.
It is not a de Polignac number, because 200020222020001 - 23 = 200020222019993 is a prime.
It is not a weakly prime, because it can be changed into another prime (200020222020901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100010111010000 + 100010111010001.
It is an arithmetic number, because the mean of its divisors is an integer number (100010111010001).
Almost surely, 2200020222020001 is an apocalyptic number.
It is an amenable number.
200020222020001 is a deficient number, since it is larger than the sum of its proper divisors (1).
200020222020001 is an equidigital number, since it uses as much as digits as its factorization.
200020222020001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 13.
Adding to 200020222020001 its reverse (100020222020002), we get a palindrome (300040444040003).
Subtracting from 200020222020001 its reverse (100020222020002), we obtain a palindrome (99999999999999).
The spelling of 200020222020001 in words is "two hundred trillion, twenty billion, two hundred twenty-two million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •