Base | Representation |
---|---|
bin | 1010001111101110… |
… | …01010101000101111 |
3 | 112012100100222220202 |
4 | 11013313022220233 |
5 | 42231124023434 |
6 | 2305453104115 |
7 | 253211265053 |
oct | 50767125057 |
9 | 15170328822 |
10 | 5500611119 |
11 | 2372a51603 |
12 | 109618803b |
13 | 698798ba3 |
14 | 3a2775c63 |
15 | 222d90a7e |
hex | 147dcaa2f |
5500611119 has 2 divisors, whose sum is σ = 5500611120. Its totient is φ = 5500611118.
The previous prime is 5500611049. The next prime is 5500611121. The reversal of 5500611119 is 9111160055.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5500611119 is a prime.
It is a super-2 number, since 2×55006111192 = 60513445364932864322, which contains 22 as substring.
Together with 5500611121, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 5500611091 and 5500611100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5500611199) 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, 2750305559 + 2750305560.
It is an arithmetic number, because the mean of its divisors is an integer number (2750305560).
Almost surely, 25500611119 is an apocalyptic number.
5500611119 is a deficient number, since it is larger than the sum of its proper divisors (1).
5500611119 is an equidigital number, since it uses as much as digits as its factorization.
5500611119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1350, while the sum is 29.
The square root of 5500611119 is about 74166.1049199700. The cubic root of 5500611119 is about 1765.2395429067.
The spelling of 5500611119 in words is "five billion, five hundred million, six hundred eleven thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •