Base | Representation |
---|---|
bin | 1010000111010001010011… |
… | …1010100000011111100111 |
3 | 1110101001201101201220222120 |
4 | 2201310110322200133213 |
5 | 2424142300412223421 |
6 | 35352244530401023 |
7 | 2225252330510601 |
oct | 241642472403747 |
9 | 43331641656876 |
10 | 11120021211111 |
11 | 35a7a7a09127a |
12 | 12b7174730173 |
13 | 6287c8b26b77 |
14 | 2a62d7640171 |
15 | 1443cd44e8c6 |
hex | a1d14ea07e7 |
11120021211111 has 8 divisors (see below), whose sum is σ = 15607047313920. Its totient is φ = 7023171291192.
The previous prime is 11120021211083. The next prime is 11120021211133. The reversal of 11120021211111 is 11111212002111.
11120021211111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11120021211111 - 231 = 11117873727463 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120021211161) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 97544045655 + ... + 97544045768.
It is an arithmetic number, because the mean of its divisors is an integer number (1950880914240).
Almost surely, 211120021211111 is an apocalyptic number.
11120021211111 is a deficient number, since it is larger than the sum of its proper divisors (4487026102809).
11120021211111 is a wasteful number, since it uses less digits than its factorization.
11120021211111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 195088091445.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 11120021211111 its reverse (11111212002111), we get a palindrome (22231233213222).
The spelling of 11120021211111 in words is "eleven trillion, one hundred twenty billion, twenty-one million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •