Base | Representation |
---|---|
bin | 10100011111111001… |
… | …10100011111010000 |
3 | 1001101221212221112111 |
4 | 22033330310133100 |
5 | 140014241120422 |
6 | 5020003435104 |
7 | 536500061512 |
oct | 121774643720 |
9 | 31357787474 |
10 | 11005020112 |
11 | 4738057549 |
12 | 2171685a94 |
13 | 1064c94628 |
14 | 765819bb2 |
15 | 446231a77 |
hex | 28ff347d0 |
11005020112 has 40 divisors (see below), whose sum is σ = 21911026176. Its totient is φ = 5350732416.
The previous prime is 11005020073. The next prime is 11005020113. The reversal of 11005020112 is 21102050011.
It is a super-2 number, since 2×110050201122 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11005020092 and 11005020101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11005020113) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1302333 + ... + 1310755.
Almost surely, 211005020112 is an apocalyptic number.
It is an amenable number.
11005020112 is a deficient number, since it is larger than the sum of its proper divisors (10906006064).
11005020112 is a wasteful number, since it uses less digits than its factorization.
11005020112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10675 (or 10669 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 13.
Adding to 11005020112 its reverse (21102050011), we get a palindrome (32107070123).
The spelling of 11005020112 in words is "eleven billion, five million, twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •