Base | Representation |
---|---|
bin | 100001011000010… |
… | …1001111001010001 |
3 | 2220001120110210211 |
4 | 1002300221321101 |
5 | 4243213111034 |
6 | 303050324121 |
7 | 36520163065 |
oct | 10260517121 |
9 | 2801513724 |
10 | 1120050769 |
11 | 52526a7a2 |
12 | 273129641 |
13 | 14b081246 |
14 | a8a7baa5 |
15 | 684e6d64 |
hex | 42c29e51 |
1120050769 has 2 divisors, whose sum is σ = 1120050770. Its totient is φ = 1120050768.
The previous prime is 1120050733. The next prime is 1120050787. The reversal of 1120050769 is 9670500211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 578883600 + 541167169 = 24060^2 + 23263^2 .
It is a cyclic number.
It is not a de Polignac number, because 1120050769 - 29 = 1120050257 is a prime.
It is a super-2 number, since 2×11200507692 = 2509027450274982722, 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 1120050769.
It is not a weakly prime, because it can be changed into another prime (1120053769) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560025384 + 560025385.
It is an arithmetic number, because the mean of its divisors is an integer number (560025385).
Almost surely, 21120050769 is an apocalyptic number.
It is an amenable number.
1120050769 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120050769 is an equidigital number, since it uses as much as digits as its factorization.
1120050769 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3780, while the sum is 31.
The square root of 1120050769 is about 33467.1595597834. The cubic root of 1120050769 is about 1038.5145116649.
The spelling of 1120050769 in words is "one billion, one hundred twenty million, fifty thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •