Base | Representation |
---|---|
bin | 1010000111011001000100… |
… | …0000010101000101110010 |
3 | 1110101021002111012110011202 |
4 | 2201312101000111011302 |
5 | 2424211031344041200 |
6 | 35353231301011202 |
7 | 2225355040413620 |
oct | 241662100250562 |
9 | 43337074173152 |
10 | 11122103112050 |
11 | 35a8948288267 |
12 | 12b76559b3b02 |
13 | 628a6b248908 |
14 | 2a6453d38510 |
15 | 1444a10de1d5 |
hex | a1d91015172 |
11122103112050 has 24 divisors (see below), whose sum is σ = 23642413473216. Its totient is φ = 3813292495440.
The previous prime is 11122103112049. The next prime is 11122103112053. The reversal of 11122103112050 is 5021130122111.
It is not an unprimeable number, because it can be changed into a prime (11122103112053) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 15888718382 + ... + 15888719081.
It is an arithmetic number, because the mean of its divisors is an integer number (985100561384).
Almost surely, 211122103112050 is an apocalyptic number.
11122103112050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11122103112050 is an abundant number, since it is smaller than the sum of its proper divisors (12520310361166).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11122103112050 is a wasteful number, since it uses less digits than its factorization.
11122103112050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31777437482 (or 31777437477 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 20.
Adding to 11122103112050 its reverse (5021130122111), we get a palindrome (16143233234161).
The spelling of 11122103112050 in words is "eleven trillion, one hundred twenty-two billion, one hundred three million, one hundred twelve thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •