Base | Representation |
---|---|
bin | 10000000000111110100… |
… | …011010001000011010111 |
3 | 10220012201222210120102210 |
4 | 100000332203101003113 |
5 | 121012422112410210 |
6 | 2201331335004503 |
7 | 142340633442102 |
oct | 20007643210327 |
9 | 3805658716383 |
10 | 1100561060055 |
11 | 394822032796 |
12 | 159367809733 |
13 | 7ca230bb982 |
14 | 3b3a5bd5739 |
15 | 1d964d7ae20 |
hex | 1003e8d10d7 |
1100561060055 has 32 divisors (see below), whose sum is σ = 1808769600000. Its totient is φ = 571013511552.
The previous prime is 1100561060047. The next prime is 1100561060063. The reversal of 1100561060055 is 5500601650011.
It is an interprime number because it is at equal distance from previous prime (1100561060047) and next prime (1100561060063).
It is not a de Polignac number, because 1100561060055 - 23 = 1100561060047 is a prime.
It is a super-2 number, since 2×11005610600552 (a number of 25 digits) contains 22 as substring.
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 31 ways as a sum of consecutive naturals, for example, 3512196 + ... + 3812694.
It is an arithmetic number, because the mean of its divisors is an integer number (56524050000).
Almost surely, 21100561060055 is an apocalyptic number.
1100561060055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1100561060055 is a deficient number, since it is larger than the sum of its proper divisors (708208539945).
1100561060055 is a wasteful number, since it uses less digits than its factorization.
1100561060055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 307143.
The product of its (nonzero) digits is 4500, while the sum is 30.
The spelling of 1100561060055 in words is "one trillion, one hundred billion, five hundred sixty-one million, sixty thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •