Base | Representation |
---|---|
bin | 1001001001000011010011… |
… | …01100000101110010100101 |
3 | 2122011202100021122011200021 |
4 | 10210201221230011302211 |
5 | 10113323321322023023 |
6 | 110430455445515141 |
7 | 4143223516440145 |
oct | 444415154056245 |
9 | 78152307564607 |
10 | 20102220111013 |
11 | 6450338209427 |
12 | 2307b40a12ab1 |
13 | b2a828a46921 |
14 | 4d6d4a0b2925 |
15 | 24cd88e6135d |
hex | 124869b05ca5 |
20102220111013 has 2 divisors, whose sum is σ = 20102220111014. Its totient is φ = 20102220111012.
The previous prime is 20102220110993. The next prime is 20102220111023. The reversal of 20102220111013 is 31011102220102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10348947452484 + 9753272658529 = 3216978^2 + 3123023^2 .
It is a cyclic number.
It is not a de Polignac number, because 20102220111013 - 25 = 20102220110981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20102220111023) 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, 10051110055506 + 10051110055507.
It is an arithmetic number, because the mean of its divisors is an integer number (10051110055507).
Almost surely, 220102220111013 is an apocalyptic number.
It is an amenable number.
20102220111013 is a deficient number, since it is larger than the sum of its proper divisors (1).
20102220111013 is an equidigital number, since it uses as much as digits as its factorization.
20102220111013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 20102220111013 its reverse (31011102220102), we get a palindrome (51113322331115).
The spelling of 20102220111013 in words is "twenty trillion, one hundred two billion, two hundred twenty million, one hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •