Base | Representation |
---|---|
bin | 1100110011101000111… |
… | …0001001100111001101 |
3 | 210000220120200011012211 |
4 | 3030322032021213031 |
5 | 12101100122320023 |
6 | 245024214430421 |
7 | 21616206106561 |
oct | 3147216114715 |
9 | 700816604184 |
10 | 220020120013 |
11 | 85345692731 |
12 | 36784362411 |
13 | 17994c1ca35 |
14 | a912d236a1 |
15 | 5acad66a0d |
hex | 333a3899cd |
220020120013 has 2 divisors, whose sum is σ = 220020120014. Its totient is φ = 220020120012.
The previous prime is 220020119987. The next prime is 220020120053. The reversal of 220020120013 is 310021020022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 146656063849 + 73364056164 = 382957^2 + 270858^2 .
It is a cyclic number.
It is not a de Polignac number, because 220020120013 - 213 = 220020111821 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 220020119975 and 220020120002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220020120053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110010060006 + 110010060007.
It is an arithmetic number, because the mean of its divisors is an integer number (110010060007).
Almost surely, 2220020120013 is an apocalyptic number.
It is an amenable number.
220020120013 is a deficient number, since it is larger than the sum of its proper divisors (1).
220020120013 is an equidigital number, since it uses as much as digits as its factorization.
220020120013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 220020120013 its reverse (310021020022), we get a palindrome (530041140035).
Subtracting 220020120013 from its reverse (310021020022), we obtain a palindrome (90000900009).
The spelling of 220020120013 in words is "two hundred twenty billion, twenty million, one hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •