Base | Representation |
---|---|
bin | 111100110011011… |
… | …010100100101101 |
3 | 2122002112000102102 |
4 | 330303122210231 |
5 | 4042122024044 |
6 | 245120304445 |
7 | 34164541661 |
oct | 7463324455 |
9 | 2562460372 |
10 | 1020111149 |
11 | 48390a672 |
12 | 245772125 |
13 | 13345c085 |
14 | 996a48a1 |
15 | 5e85524e |
hex | 3ccda92d |
1020111149 has 2 divisors, whose sum is σ = 1020111150. Its totient is φ = 1020111148.
The previous prime is 1020111107. The next prime is 1020111151. The reversal of 1020111149 is 9411110201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1003749124 + 16362025 = 31682^2 + 4045^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1020111149 is a prime.
Together with 1020111151, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1020111149.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1020101149) 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, 510055574 + 510055575.
It is an arithmetic number, because the mean of its divisors is an integer number (510055575).
Almost surely, 21020111149 is an apocalyptic number.
It is an amenable number.
1020111149 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020111149 is an equidigital number, since it uses as much as digits as its factorization.
1020111149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 20.
The square root of 1020111149 is about 31939.1789030338. The cubic root of 1020111149 is about 1006.6592719927.
The spelling of 1020111149 in words is "one billion, twenty million, one hundred eleven thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •