Base | Representation |
---|---|
bin | 1001000110000101010001… |
… | …11011111101100011010001 |
3 | 2121211000000110121020110201 |
4 | 10203002220323331203101 |
5 | 10110140403204133243 |
6 | 110311544352055201 |
7 | 4132652436124411 |
oct | 443025073754321 |
9 | 77730013536421 |
10 | 20000202021073 |
11 | 64110467004aa |
12 | 22b020b234501 |
13 | b2101b0c7c31 |
14 | 4d202d008641 |
15 | 24a3b798e04d |
hex | 1230a8efd8d1 |
20000202021073 has 2 divisors, whose sum is σ = 20000202021074. Its totient is φ = 20000202021072.
The previous prime is 20000202021071. The next prime is 20000202021097. The reversal of 20000202021073 is 37012020200002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19618317572049 + 381884449024 = 4429257^2 + 617968^2 .
It is a cyclic number.
It is not a de Polignac number, because 20000202021073 - 21 = 20000202021071 is a prime.
Together with 20000202021071, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 20000202021073.
It is not a weakly prime, because it can be changed into another prime (20000202021071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10000101010536 + 10000101010537.
It is an arithmetic number, because the mean of its divisors is an integer number (10000101010537).
Almost surely, 220000202021073 is an apocalyptic number.
It is an amenable number.
20000202021073 is a deficient number, since it is larger than the sum of its proper divisors (1).
20000202021073 is an equidigital number, since it uses as much as digits as its factorization.
20000202021073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 336, while the sum is 19.
Adding to 20000202021073 its reverse (37012020200002), we get a palindrome (57012222221075).
The spelling of 20000202021073 in words is "twenty trillion, two hundred two million, twenty-one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •