Base | Representation |
---|---|
bin | 1010010101101011… |
… | …11001101010101101 |
3 | 112022211110021000112 |
4 | 11022311321222231 |
5 | 42331424023432 |
6 | 2314440505405 |
7 | 254356262462 |
oct | 51265715255 |
9 | 15284407015 |
10 | 5550611117 |
11 | 23991a2317 |
12 | 10aaa7b265 |
13 | 6a5c5429c |
14 | 3a926d669 |
15 | 22746a7b2 |
hex | 14ad79aad |
5550611117 has 4 divisors (see below), whose sum is σ = 5552891196. Its totient is φ = 5548331040.
The previous prime is 5550611111. The next prime is 5550611149. The reversal of 5550611117 is 7111160555.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5321118916 + 229492201 = 72946^2 + 15149^2 .
It is a cyclic number.
It is not a de Polignac number, because 5550611117 - 226 = 5483502253 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5550611111) 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 in 3 ways as a sum of consecutive naturals, for example, 1136384 + ... + 1141257.
It is an arithmetic number, because the mean of its divisors is an integer number (1388222799).
Almost surely, 25550611117 is an apocalyptic number.
It is an amenable number.
5550611117 is a deficient number, since it is larger than the sum of its proper divisors (2280079).
5550611117 is a wasteful number, since it uses less digits than its factorization.
5550611117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2280078.
The product of its (nonzero) digits is 5250, while the sum is 32.
The square root of 5550611117 is about 74502.4235646063. The cubic root of 5550611117 is about 1770.5720343513.
The spelling of 5550611117 in words is "five billion, five hundred fifty million, six hundred eleven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •