Base | Representation |
---|---|
bin | 101000000001001011111… |
… | …0101110101011101100111 |
3 | 201110210201211001102212100 |
4 | 1100002113311311131213 |
5 | 1210103204014023421 |
6 | 15410414051223143 |
7 | 1105240513213566 |
oct | 120022765653547 |
9 | 21423654042770 |
10 | 5500105611111 |
11 | 1830644259171 |
12 | 749b5a2a7ab3 |
13 | 30b87206b807 |
14 | 1502c6a1bbdd |
15 | 9810c766c26 |
hex | 50097d75767 |
5500105611111 has 24 divisors (see below), whose sum is σ = 8639275595184. Its totient is φ = 3357775123200.
The previous prime is 5500105611103. The next prime is 5500105611149. The reversal of 5500105611111 is 1111165010055.
5500105611111 is a `hidden beast` number, since 550 + 0 + 105 + 6 + 1 + 1 + 1 + 1 + 1 = 666.
It is not a de Polignac number, because 5500105611111 - 23 = 5500105611103 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5500105611151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 485783565 + ... + 485794886.
It is an arithmetic number, because the mean of its divisors is an integer number (359969816466).
Almost surely, 25500105611111 is an apocalyptic number.
5500105611111 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
5500105611111 is a deficient number, since it is larger than the sum of its proper divisors (3139169984073).
5500105611111 is a wasteful number, since it uses less digits than its factorization.
5500105611111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 971578511 (or 971578508 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 27.
The spelling of 5500105611111 in words is "five trillion, five hundred billion, one hundred five million, six hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •