Base | Representation |
---|---|
bin | 1010000000111110111100… |
… | …0101001101111100101100 |
3 | 1102222201221001220212000002 |
4 | 2200033233011031330230 |
5 | 2420410100122131444 |
6 | 35230503144523432 |
7 | 2214406634105321 |
oct | 240175705157454 |
9 | 42881831825002 |
10 | 11012012302124 |
11 | 3566193953329 |
12 | 129a250780578 |
13 | 61b574ca5232 |
14 | 2a0daca76b48 |
15 | 1416ab059d4e |
hex | a03ef14df2c |
11012012302124 has 12 divisors (see below), whose sum is σ = 19271049846048. Its totient is φ = 5505998060400.
The previous prime is 11012012302121. The next prime is 11012012302141. The reversal of 11012012302124 is 42120321021011.
It is a super-2 number, since 2×110120123021242 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11012012302096 and 11012012302105.
It is not an unprimeable number, because it can be changed into a prime (11012012302121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1873754 + ... + 5053214.
It is an arithmetic number, because the mean of its divisors is an integer number (1605920820504).
Almost surely, 211012012302124 is an apocalyptic number.
It is an amenable number.
11012012302124 is a deficient number, since it is larger than the sum of its proper divisors (8259037543924).
11012012302124 is a wasteful number, since it uses less digits than its factorization.
11012012302124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4045336 (or 4045334 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 11012012302124 its reverse (42120321021011), we get a palindrome (53132333323135).
The spelling of 11012012302124 in words is "eleven trillion, twelve billion, twelve million, three hundred two thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •