Base | Representation |
---|---|
bin | 101101100001100101100110… |
… | …000001001011000010001001 |
3 | 222020220212100010120202000212 |
4 | 231201211212001023002021 |
5 | 202220401433204133001 |
6 | 1545455520243010505 |
7 | 60113301153521111 |
oct | 5541454601130211 |
9 | 866825303522025 |
10 | 200220202021001 |
11 | 58883a02346978 |
12 | 1a558024669a35 |
13 | 87948b7a99b26 |
14 | 37629d0b78041 |
15 | 18232c0d877bb |
hex | b6196604b089 |
200220202021001 has 2 divisors, whose sum is σ = 200220202021002. Its totient is φ = 200220202021000.
The previous prime is 200220202020989. The next prime is 200220202021093. The reversal of 200220202021001 is 100120202022002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 155508980664976 + 44711221356025 = 12470324^2 + 6686645^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200220202021001 is a prime.
It is not a weakly prime, because it can be changed into another prime (200220202221001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100110101010500 + 100110101010501.
It is an arithmetic number, because the mean of its divisors is an integer number (100110101010501).
Almost surely, 2200220202021001 is an apocalyptic number.
It is an amenable number.
200220202021001 is a deficient number, since it is larger than the sum of its proper divisors (1).
200220202021001 is an equidigital number, since it uses as much as digits as its factorization.
200220202021001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 200220202021001 its reverse (100120202022002), we get a palindrome (300340404043003).
The spelling of 200220202021001 in words is "two hundred trillion, two hundred twenty billion, two hundred two million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •