Base | Representation |
---|---|
bin | 100001010000101… |
… | …1101010011110101 |
3 | 2212210002002012002 |
4 | 1002201131103311 |
5 | 4241203121221 |
6 | 302425105045 |
7 | 36441261554 |
oct | 10241352365 |
9 | 2783062162 |
10 | 1116067061 |
11 | 522a9977a |
12 | 271928185 |
13 | 14a2b7c15 |
14 | a8321d9b |
15 | 67eab80b |
hex | 4285d4f5 |
1116067061 has 2 divisors, whose sum is σ = 1116067062. Its totient is φ = 1116067060.
The previous prime is 1116067033. The next prime is 1116067081. The reversal of 1116067061 is 1607606111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 768952900 + 347114161 = 27730^2 + 18631^2 .
It is a cyclic number.
It is not a de Polignac number, because 1116067061 - 210 = 1116066037 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1116067081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 558033530 + 558033531.
It is an arithmetic number, because the mean of its divisors is an integer number (558033531).
Almost surely, 21116067061 is an apocalyptic number.
It is an amenable number.
1116067061 is a deficient number, since it is larger than the sum of its proper divisors (1).
1116067061 is an equidigital number, since it uses as much as digits as its factorization.
1116067061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 29.
The square root of 1116067061 is about 33407.5898711655. The cubic root of 1116067061 is about 1037.2818136241.
It can be divided in two parts, 11 and 16067061, that multiplied together give a palindrome (176737671).
The spelling of 1116067061 in words is "one billion, one hundred sixteen million, sixty-seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •