Base | Representation |
---|---|
bin | 11101001000100001101… |
… | …100111110111101100101 |
3 | 21002101120020012122210011 |
4 | 131020201230332331211 |
5 | 230300114132402133 |
6 | 4131414304530221 |
7 | 264432632631601 |
oct | 35104154767545 |
9 | 7071506178704 |
10 | 2002020200293 |
11 | 702063235203 |
12 | 284008620971 |
13 | 116a35c62069 |
14 | 6cc80cc6501 |
15 | 371255306cd |
hex | 1d221b3ef65 |
2002020200293 has 2 divisors, whose sum is σ = 2002020200294. Its totient is φ = 2002020200292.
The previous prime is 2002020200291. The next prime is 2002020200311. The reversal of 2002020200293 is 3920020202002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1423253772004 + 578766428289 = 1193002^2 + 760767^2 .
It is a cyclic number.
It is not a de Polignac number, because 2002020200293 - 21 = 2002020200291 is a prime.
Together with 2002020200291, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2002020200291) 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, 1001010100146 + 1001010100147.
It is an arithmetic number, because the mean of its divisors is an integer number (1001010100147).
Almost surely, 22002020200293 is an apocalyptic number.
It is an amenable number.
2002020200293 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002020200293 is an equidigital number, since it uses as much as digits as its factorization.
2002020200293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 2002020200293 its reverse (3920020202002), we get a palindrome (5922040402295).
The spelling of 2002020200293 in words is "two trillion, two billion, twenty million, two hundred thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •