Base | Representation |
---|---|
bin | 11101011001010111011… |
… | …101101010000001001001 |
3 | 21011010020101100022222112 |
4 | 131121113131222001021 |
5 | 231044132104134233 |
6 | 4144004433032105 |
7 | 265643003602604 |
oct | 35312735520111 |
9 | 7133211308875 |
10 | 2020102021193 |
11 | 7097a1a21943 |
12 | 2876140b5635 |
13 | 11865810c779 |
14 | 6dab853133b |
15 | 37832b9c048 |
hex | 1d65776a049 |
2020102021193 has 2 divisors, whose sum is σ = 2020102021194. Its totient is φ = 2020102021192.
The previous prime is 2020102021187. The next prime is 2020102021207. The reversal of 2020102021193 is 3911202010202.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1915198584649 + 104903436544 = 1383907^2 + 323888^2 .
It is a cyclic number.
It is not a de Polignac number, because 2020102021193 - 230 = 2019028279369 is a prime.
It is a super-2 number, since 2×20201020211932 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (2020102021103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1010051010596 + 1010051010597.
It is an arithmetic number, because the mean of its divisors is an integer number (1010051010597).
Almost surely, 22020102021193 is an apocalyptic number.
It is an amenable number.
2020102021193 is a deficient number, since it is larger than the sum of its proper divisors (1).
2020102021193 is an equidigital number, since it uses as much as digits as its factorization.
2020102021193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 2020102021193 its reverse (3911202010202), we get a palindrome (5931304031395).
The spelling of 2020102021193 in words is "two trillion, twenty billion, one hundred two million, twenty-one thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •