Base | Representation |
---|---|
bin | 1010000011110011110011… |
… | …0000010111101011010111 |
3 | 1110011101020110011111220010 |
4 | 2200330330300113223113 |
5 | 2422204011341200210 |
6 | 35305052352411303 |
7 | 2221045663426644 |
oct | 240747460275327 |
9 | 43141213144803 |
10 | 11060560100055 |
11 | 3584836912484 |
12 | 12a773b246b33 |
13 | 623010c1999b |
14 | 2a3496586dcb |
15 | 142a9d197920 |
hex | a0f3cc17ad7 |
11060560100055 has 16 divisors (see below), whose sum is σ = 17699666214240. Its totient is φ = 5898042035328.
The previous prime is 11060560099991. The next prime is 11060560100113. The reversal of 11060560100055 is 55000106506011.
It is not a de Polignac number, because 11060560100055 - 26 = 11060560099991 is a prime.
It is a super-2 number, since 2×110605601000552 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11060560099995 and 11060560100031.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 57610432 + ... + 57802101.
It is an arithmetic number, because the mean of its divisors is an integer number (1106229138390).
Almost surely, 211060560100055 is an apocalyptic number.
11060560100055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11060560100055 is a deficient number, since it is larger than the sum of its proper divisors (6639106114185).
11060560100055 is a wasteful number, since it uses less digits than its factorization.
11060560100055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 115418930.
The product of its (nonzero) digits is 4500, while the sum is 30.
Adding to 11060560100055 its reverse (55000106506011), we get a palindrome (66060666606066).
The spelling of 11060560100055 in words is "eleven trillion, sixty billion, five hundred sixty million, one hundred thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •