Base | Representation |
---|---|
bin | 1100110100000000110… |
… | …0011000100001110001 |
3 | 210001011120012211220122 |
4 | 3031000030120201301 |
5 | 12101301300220423 |
6 | 245042154220025 |
7 | 21621533564261 |
oct | 3150014304161 |
9 | 701146184818 |
10 | 220120320113 |
11 | 85397200531 |
12 | 367b1a24615 |
13 | 179ac903635 |
14 | a9223677a1 |
15 | 5ad4a5a8c8 |
hex | 3340318871 |
220120320113 has 2 divisors, whose sum is σ = 220120320114. Its totient is φ = 220120320112.
The previous prime is 220120320103. The next prime is 220120320131. The reversal of 220120320113 is 311023021022.
Together with next prime (220120320131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 219720000049 + 400320064 = 468743^2 + 20008^2 .
It is a cyclic number.
It is not a de Polignac number, because 220120320113 - 222 = 220116125809 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 220120320091 and 220120320100.
It is not a weakly prime, because it can be changed into another prime (220120320103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110060160056 + 110060160057.
It is an arithmetic number, because the mean of its divisors is an integer number (110060160057).
Almost surely, 2220120320113 is an apocalyptic number.
It is an amenable number.
220120320113 is a deficient number, since it is larger than the sum of its proper divisors (1).
220120320113 is an equidigital number, since it uses as much as digits as its factorization.
220120320113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 220120320113 its reverse (311023021022), we get a palindrome (531143341135).
The spelling of 220120320113 in words is "two hundred twenty billion, one hundred twenty million, three hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •