Base | Representation |
---|---|
bin | 1010000110001110111101… |
… | …1001110101101100011111 |
3 | 1110022100202020121022221200 |
4 | 2201203233121311230133 |
5 | 2423344312234133043 |
6 | 35340141421530543 |
7 | 2224052110055604 |
oct | 241435731655437 |
9 | 43270666538850 |
10 | 11102212021023 |
11 | 35a0470285162 |
12 | 12b3824413a53 |
13 | 626c1b2b3876 |
14 | 2a54c82c26ab |
15 | 143bd9bd77d3 |
hex | a18ef675b1f |
11102212021023 has 24 divisors (see below), whose sum is σ = 16105830378768. Its totient is φ = 7369491065472.
The previous prime is 11102212020989. The next prime is 11102212021111. The reversal of 11102212021023 is 32012021220111.
It is not a de Polignac number, because 11102212021023 - 225 = 11102178466591 is a prime.
It is a super-2 number, since 2×111022120210232 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11102212020987 and 11102212021005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11102212021123) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 103951536 + ... + 104058282.
It is an arithmetic number, because the mean of its divisors is an integer number (671076265782).
Almost surely, 211102212021023 is an apocalyptic number.
11102212021023 is a deficient number, since it is larger than the sum of its proper divisors (5003618357745).
11102212021023 is a wasteful number, since it uses less digits than its factorization.
11102212021023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 156583 (or 156580 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 11102212021023 its reverse (32012021220111), we get a palindrome (43114233241134).
The spelling of 11102212021023 in words is "eleven trillion, one hundred two billion, two hundred twelve million, twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •