Base | Representation |
---|---|
bin | 1010010000011011… |
… | …10100111100110101 |
3 | 112012202112210201202 |
4 | 11020031310330311 |
5 | 42234134122410 |
6 | 2310224302245 |
7 | 253312626212 |
oct | 51015647465 |
9 | 15182483652 |
10 | 5506551605 |
11 | 23763397a5 |
12 | 1098171985 |
13 | 699a98a79 |
14 | 3a3480b09 |
15 | 223665ca5 |
hex | 148374f35 |
5506551605 has 4 divisors (see below), whose sum is σ = 6607861932. Its totient is φ = 4405241280.
The previous prime is 5506551599. The next prime is 5506551619. The reversal of 5506551605 is 5061556055.
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 3335178001 + 2171373604 = 57751^2 + 46598^2 .
It is not a de Polignac number, because 5506551605 - 26 = 5506551541 is a prime.
It is a super-2 number, since 2×55065516052 = 60644221157056152050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 550655156 + ... + 550655165.
It is an arithmetic number, because the mean of its divisors is an integer number (1651965483).
Almost surely, 25506551605 is an apocalyptic number.
It is an amenable number.
5506551605 is a deficient number, since it is larger than the sum of its proper divisors (1101310327).
5506551605 is a wasteful number, since it uses less digits than its factorization.
5506551605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1101310326.
The product of its (nonzero) digits is 112500, while the sum is 38.
The square root of 5506551605 is about 74206.1426365769. The cubic root of 5506551605 is about 1765.8747819036.
The spelling of 5506551605 in words is "five billion, five hundred six million, five hundred fifty-one thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •