Base | Representation |
---|---|
bin | 1010000011011111011101… |
… | …0111111101001110011010 |
3 | 1110010212011000002211112221 |
4 | 2200313313113331032122 |
5 | 2422111321340330200 |
6 | 35302350543254254 |
7 | 2220463465640422 |
oct | 240676727751632 |
9 | 43125130084487 |
10 | 11055101105050 |
11 | 3582495405762 |
12 | 12a6676baa38a |
13 | 622650c62122 |
14 | 2a30d9565482 |
15 | 14287dcc791a |
hex | a0df75fd39a |
11055101105050 has 48 divisors (see below), whose sum is σ = 20713888726272. Its totient is φ = 4389485244800.
The previous prime is 11055101105047. The next prime is 11055101105053. The reversal of 11055101105050 is 5050110155011.
It is an interprime number because it is at equal distance from previous prime (11055101105047) and next prime (11055101105053).
It is a super-2 number, since 2×110551011050502 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (11055101105053) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 134020119 + ... + 134102581.
It is an arithmetic number, because the mean of its divisors is an integer number (431539348464).
Almost surely, 211055101105050 is an apocalyptic number.
11055101105050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11055101105050 is a deficient number, since it is larger than the sum of its proper divisors (9658787621222).
11055101105050 is a wasteful number, since it uses less digits than its factorization.
11055101105050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102183 (or 102178 counting only the distinct ones).
The product of its (nonzero) digits is 625, while the sum is 25.
The spelling of 11055101105050 in words is "eleven trillion, fifty-five billion, one hundred one million, one hundred five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •