Base | Representation |
---|---|
bin | 100001011000101… |
… | …0000110001000101 |
3 | 2220001212120012212 |
4 | 1002301100301011 |
5 | 4243233204424 |
6 | 303053553205 |
7 | 36521425223 |
oct | 10261206105 |
9 | 2801776185 |
10 | 1120209989 |
11 | 525369388 |
12 | 2731a5805 |
13 | 14b108862 |
14 | a8abdb13 |
15 | 6852910e |
hex | 42c50c45 |
1120209989 has 2 divisors, whose sum is σ = 1120209990. Its totient is φ = 1120209988.
The previous prime is 1120209983. The next prime is 1120209991. The reversal of 1120209989 is 9899020211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1100049889 + 20160100 = 33167^2 + 4490^2 .
It is an emirp because it is prime and its reverse (9899020211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1120209989 - 24 = 1120209973 is a prime.
Together with 1120209991, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1120209983) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560104994 + 560104995.
It is an arithmetic number, because the mean of its divisors is an integer number (560104995).
Almost surely, 21120209989 is an apocalyptic number.
It is an amenable number.
1120209989 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120209989 is an equidigital number, since it uses as much as digits as its factorization.
1120209989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 41.
The square root of 1120209989 is about 33469.5382250786. The cubic root of 1120209989 is about 1038.5637190909.
The spelling of 1120209989 in words is "one billion, one hundred twenty million, two hundred nine thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •