Base | Representation |
---|---|
bin | 100001101101010… |
… | …0101110011101101 |
3 | 2220211020222210101 |
4 | 1003122211303231 |
5 | 4304021402302 |
6 | 304122111101 |
7 | 40012500412 |
oct | 10332456355 |
9 | 2824228711 |
10 | 1131044077 |
11 | 530499179 |
12 | 27694b491 |
13 | 15042cc67 |
14 | aa300109 |
15 | 69469287 |
hex | 436a5ced |
1131044077 has 2 divisors, whose sum is σ = 1131044078. Its totient is φ = 1131044076.
The previous prime is 1131044029. The next prime is 1131044147. The reversal of 1131044077 is 7704401311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 976812516 + 154231561 = 31254^2 + 12419^2 .
It is an emirp because it is prime and its reverse (7704401311) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1131044077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1131044477) 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, 565522038 + 565522039.
It is an arithmetic number, because the mean of its divisors is an integer number (565522039).
Almost surely, 21131044077 is an apocalyptic number.
It is an amenable number.
1131044077 is a deficient number, since it is larger than the sum of its proper divisors (1).
1131044077 is an equidigital number, since it uses as much as digits as its factorization.
1131044077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2352, while the sum is 28.
The square root of 1131044077 is about 33630.9987511522. The cubic root of 1131044077 is about 1041.9011321198.
Adding to 1131044077 its reverse (7704401311), we get a palindrome (8835445388).
The spelling of 1131044077 in words is "one billion, one hundred thirty-one million, forty-four thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •