Base | Representation |
---|---|
bin | 1010011100111001… |
… | …01100001011110111 |
3 | 112111001021222110211 |
4 | 11032130230023313 |
5 | 42442421024114 |
6 | 2324441330251 |
7 | 256022441443 |
oct | 51634541367 |
9 | 15431258424 |
10 | 5611111159 |
11 | 241a364955 |
12 | 1107196987 |
13 | 6b5647a24 |
14 | 3b32db823 |
15 | 22c91b6c4 |
hex | 14e72c2f7 |
5611111159 has 2 divisors, whose sum is σ = 5611111160. Its totient is φ = 5611111158.
The previous prime is 5611111133. The next prime is 5611111189. The reversal of 5611111159 is 9511111165.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5611111159 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5611111159.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5611111189) 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, 2805555579 + 2805555580.
It is an arithmetic number, because the mean of its divisors is an integer number (2805555580).
Almost surely, 25611111159 is an apocalyptic number.
5611111159 is a deficient number, since it is larger than the sum of its proper divisors (1).
5611111159 is an equidigital number, since it uses as much as digits as its factorization.
5611111159 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1350, while the sum is 31.
The square root of 5611111159 is about 74907.3505004682. The cubic root of 5611111159 is about 1776.9817088184.
The spelling of 5611111159 in words is "five billion, six hundred eleven million, one hundred eleven thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •