Base | Representation |
---|---|
bin | 1010000110011101010011… |
… | …0100101111100000110010 |
3 | 1110022201200111020120101112 |
4 | 2201213110310233200302 |
5 | 2423430203112243200 |
6 | 35342015400033322 |
7 | 2224246355243222 |
oct | 241472464574062 |
9 | 43281614216345 |
10 | 11106061056050 |
11 | 35a2065a28144 |
12 | 12b4519462842 |
13 | 6273b285909c |
14 | 2a577157a082 |
15 | 143d62a8c535 |
hex | a19d4d2f832 |
11106061056050 has 48 divisors (see below), whose sum is σ = 20721800987712. Its totient is φ = 4428550315200.
The previous prime is 11106061056047. The next prime is 11106061056091. The reversal of 11106061056050 is 5065016060111.
It is a junction number, because it is equal to n+sod(n) for n = 11106061055998 and 11106061056016.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 195476747 + ... + 195533553.
It is an arithmetic number, because the mean of its divisors is an integer number (431704187244).
Almost surely, 211106061056050 is an apocalyptic number.
11106061056050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11106061056050 is a deficient number, since it is larger than the sum of its proper divisors (9615739931662).
11106061056050 is a wasteful number, since it uses less digits than its factorization.
11106061056050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68963 (or 68958 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 32.
The spelling of 11106061056050 in words is "eleven trillion, one hundred six billion, sixty-one million, fifty-six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •