Base | Representation |
---|---|
bin | 10100100101011001… |
… | …01101011101001010 |
3 | 1001112011122111120010 |
4 | 22102230231131022 |
5 | 140113042104100 |
6 | 5024332012350 |
7 | 540600020652 |
oct | 122254553512 |
9 | 31464574503 |
10 | 11051128650 |
11 | 476108a581 |
12 | 21850010b6 |
13 | 10716b96a3 |
14 | 76b9bd362 |
15 | 44a2dd750 |
hex | 292b2d74a |
11051128650 has 48 divisors (see below), whose sum is σ = 28849269600. Its totient is φ = 2791863360.
The previous prime is 11051128607. The next prime is 11051128657. The reversal of 11051128650 is 5682115011.
11051128650 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11051128657) 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 23 ways as a sum of consecutive naturals, for example, 1935945 + ... + 1941644.
It is an arithmetic number, because the mean of its divisors is an integer number (601026450).
Almost surely, 211051128650 is an apocalyptic number.
11051128650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11051128650 is an abundant number, since it is smaller than the sum of its proper divisors (17798140950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11051128650 is a wasteful number, since it uses less digits than its factorization.
11051128650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3877623 (or 3877618 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 30.
The spelling of 11051128650 in words is "eleven billion, fifty-one million, one hundred twenty-eight thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •