Base | Representation |
---|---|
bin | 10100100000101000… |
… | …00011100010001100 |
3 | 1001102101100101201212 |
4 | 22100110003202030 |
5 | 140022321023202 |
6 | 5020342153552 |
7 | 536602620404 |
oct | 122024034214 |
9 | 31371311655 |
10 | 11011111052 |
11 | 4740537787 |
12 | 21737228b8 |
13 | 1066317b36 |
14 | 766563804 |
15 | 446a36652 |
hex | 29050388c |
11011111052 has 12 divisors (see below), whose sum is σ = 19790240400. Its totient is φ = 5356756656.
The previous prime is 11011111051. The next prime is 11011111117. The reversal of 11011111052 is 25011111011.
It is not an unprimeable number, because it can be changed into a prime (11011111051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 37199552 + ... + 37199847.
It is an arithmetic number, because the mean of its divisors is an integer number (1649186700).
Almost surely, 211011111052 is an apocalyptic number.
It is an amenable number.
11011111052 is a deficient number, since it is larger than the sum of its proper divisors (8779129348).
11011111052 is a wasteful number, since it uses less digits than its factorization.
11011111052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74399440 (or 74399438 counting only the distinct ones).
The product of its (nonzero) digits is 10, while the sum is 14.
Adding to 11011111052 its reverse (25011111011), we get a palindrome (36022222063).
The spelling of 11011111052 in words is "eleven billion, eleven million, one hundred eleven thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •