Base | Representation |
---|---|
bin | 101000011101100101110… |
… | …1100000011110110101011 |
3 | 201200122011222011202122220 |
4 | 1100323023230003312223 |
5 | 1212103120340142440 |
6 | 15454423020045123 |
7 | 1112530236422160 |
oct | 120731354036653 |
9 | 21618158152586 |
10 | 5561105005995 |
11 | 18544a6886410 |
12 | 7599429937a3 |
13 | 314543883606 |
14 | 153232102067 |
15 | 999ccacb8d0 |
hex | 50ecbb03dab |
5561105005995 has 32 divisors (see below), whose sum is σ = 11093321157120. Its totient is φ = 2311108573440.
The previous prime is 5561105005993. The next prime is 5561105005997. The reversal of 5561105005995 is 5995005011655.
It is an interprime number because it is at equal distance from previous prime (5561105005993) and next prime (5561105005997).
It is not a de Polignac number, because 5561105005995 - 21 = 5561105005993 is a prime.
It is not an unprimeable number, because it can be changed into a prime (5561105005993) 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 31 ways as a sum of consecutive naturals, for example, 2407403610 + ... + 2407405919.
It is an arithmetic number, because the mean of its divisors is an integer number (346666286160).
Almost surely, 25561105005995 is an apocalyptic number.
5561105005995 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
5561105005995 is a deficient number, since it is larger than the sum of its proper divisors (5532216151125).
5561105005995 is a wasteful number, since it uses less digits than its factorization.
5561105005995 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4814809555.
The product of its (nonzero) digits is 1518750, while the sum is 51.
The spelling of 5561105005995 in words is "five trillion, five hundred sixty-one billion, one hundred five million, five thousand, nine hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •