Base | Representation |
---|---|
bin | 100001011010010… |
… | …1110111111011011 |
3 | 2220010120210211002 |
4 | 1002310232333123 |
5 | 4244001321334 |
6 | 303125255215 |
7 | 36532236032 |
oct | 10264567733 |
9 | 2803523732 |
10 | 1121120219 |
11 | 52593023a |
12 | 27356450b |
13 | 14b366c5b |
14 | a8c79719 |
15 | 68658b7e |
hex | 42d2efdb |
1121120219 has 2 divisors, whose sum is σ = 1121120220. Its totient is φ = 1121120218.
The previous prime is 1121120171. The next prime is 1121120291. The reversal of 1121120219 is 9120211211.
Together with next prime (1121120291) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1121120219 - 28 = 1121119963 is a prime.
It is a super-2 number, since 2×11211202192 = 2513821090901215922, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1121120219.
It is not a weakly prime, because it can be changed into another prime (1121120519) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560560109 + 560560110.
It is an arithmetic number, because the mean of its divisors is an integer number (560560110).
Almost surely, 21121120219 is an apocalyptic number.
1121120219 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121120219 is an equidigital number, since it uses as much as digits as its factorization.
1121120219 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 1121120219 is about 33483.1333509873. The cubic root of 1121120219 is about 1038.8449389618.
The spelling of 1121120219 in words is "one billion, one hundred twenty-one million, one hundred twenty thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •