Base | Representation |
---|---|
bin | 1010000000111001101011… |
… | …1101101111010101001000 |
3 | 1102222121021201102002122211 |
4 | 2200032122331233111020 |
5 | 2420344202332234220 |
6 | 35230111132554504 |
7 | 2214326646522001 |
oct | 240163275572510 |
9 | 42877251362584 |
10 | 11010601055560 |
11 | 356562a282957 |
12 | 1299b18022a34 |
13 | 61b3ab7b96b2 |
14 | 2a0cb74781a8 |
15 | 1416271e2b5a |
hex | a039af6f548 |
11010601055560 has 16 divisors (see below), whose sum is σ = 24773852375100. Its totient is φ = 4404240422208.
The previous prime is 11010601055557. The next prime is 11010601055651. The reversal of 11010601055560 is 6555010601011.
11010601055560 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 10160653506084 + 849947549476 = 3187578^2 + 921926^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 137632513155 + ... + 137632513234.
Almost surely, 211010601055560 is an apocalyptic number.
11010601055560 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11010601055560 is an abundant number, since it is smaller than the sum of its proper divisors (13763251319540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010601055560 is a wasteful number, since it uses less digits than its factorization.
11010601055560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 275265026400 (or 275265026396 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 31.
Adding to 11010601055560 its reverse (6555010601011), we get a palindrome (17565611656571).
The spelling of 11010601055560 in words is "eleven trillion, ten billion, six hundred one million, fifty-five thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •