Base | Representation |
---|---|
bin | 1000010001010100… |
… | …0101011111001101 |
3 | 12201201112210010011 |
4 | 2010111011133031 |
5 | 14021322320023 |
6 | 1004144513221 |
7 | 106005465046 |
oct | 20425053715 |
9 | 5651483104 |
10 | 2220120013 |
11 | a3a222031 |
12 | 51b61b811 |
13 | 294c575a7 |
14 | 170bd78cd |
15 | ced9350d |
hex | 845457cd |
2220120013 has 2 divisors, whose sum is σ = 2220120014. Its totient is φ = 2220120012.
The previous prime is 2220119987. The next prime is 2220120031. The reversal of 2220120013 is 3100210222.
Together with next prime (2220120031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1913800009 + 306320004 = 43747^2 + 17502^2 .
It is a cyclic number.
It is not a de Polignac number, because 2220120013 - 29 = 2220119501 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2220119975 and 2220120002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2220120043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1110060006 + 1110060007.
It is an arithmetic number, because the mean of its divisors is an integer number (1110060007).
Almost surely, 22220120013 is an apocalyptic number.
It is an amenable number.
2220120013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2220120013 is an equidigital number, since it uses as much as digits as its factorization.
2220120013 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 13.
The square root of 2220120013 is about 47118.1495073820. The cubic root of 2220120013 is about 1304.5442570216.
Adding to 2220120013 its reverse (3100210222), we get a palindrome (5320330235).
The spelling of 2220120013 in words is "two billion, two hundred twenty million, one hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •