Base | Representation |
---|---|
bin | 100100010111001… |
… | …0110011010111101 |
3 | 10011000212000021202 |
4 | 1020232112122331 |
5 | 4444322010023 |
6 | 321023105245 |
7 | 42143523023 |
oct | 11056263275 |
9 | 3130760252 |
10 | 1220110013 |
11 | 5767a1791 |
12 | 2a0742225 |
13 | 165a159b5 |
14 | b8086713 |
15 | 721ae128 |
hex | 48b966bd |
1220110013 has 2 divisors, whose sum is σ = 1220110014. Its totient is φ = 1220110012.
The previous prime is 1220109991. The next prime is 1220110033. The reversal of 1220110013 is 3100110221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 865654084 + 354455929 = 29422^2 + 18827^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1220110013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1220109976 and 1220110003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1220110033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 610055006 + 610055007.
It is an arithmetic number, because the mean of its divisors is an integer number (610055007).
Almost surely, 21220110013 is an apocalyptic number.
It is an amenable number.
1220110013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1220110013 is an equidigital number, since it uses as much as digits as its factorization.
1220110013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 1220110013 is about 34930.0731891589. The cubic root of 1220110013 is about 1068.5618472603.
Adding to 1220110013 its reverse (3100110221), we get a palindrome (4320220234).
The spelling of 1220110013 in words is "one billion, two hundred twenty million, one hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •