Base | Representation |
---|---|
bin | 10100101011111100… |
… | …01111001110001010 |
3 | 1001200000000001102020 |
4 | 22111332033032022 |
5 | 140221122230200 |
6 | 5034013145310 |
7 | 542134624146 |
oct | 122576171612 |
9 | 31600001366 |
10 | 11106055050 |
11 | 478a0955a2 |
12 | 219b48b236 |
13 | 107cbab20c |
14 | 774dda226 |
15 | 45003cea0 |
hex | 295f8f38a |
11106055050 has 192 divisors, whose sum is σ = 29220808320. Its totient is φ = 2787886080.
The previous prime is 11106055027. The next prime is 11106055091. The reversal of 11106055050 is 5055060111.
It is a self number, because there is not a number n which added to its sum of digits gives 11106055050.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 41286316 + ... + 41286584.
It is an arithmetic number, because the mean of its divisors is an integer number (152191710).
Almost surely, 211106055050 is an apocalyptic number.
11106055050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 11106055050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14610404160).
11106055050 is an abundant number, since it is smaller than the sum of its proper divisors (18114753270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11106055050 is a wasteful number, since it uses less digits than its factorization.
11106055050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 537 (or 532 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 24.
The spelling of 11106055050 in words is "eleven billion, one hundred six million, fifty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •