Base | Representation |
---|---|
bin | 1010000111010001010011… |
… | …1101111110111001111111 |
3 | 1110101001201110110012122022 |
4 | 2201310110331332321333 |
5 | 2424142301130401421 |
6 | 35352245002110355 |
7 | 2225252341323560 |
oct | 241642475767177 |
9 | 43331643405568 |
10 | 11120022122111 |
11 | 35a7a7a653771 |
12 | 12b7174aab3bb |
13 | 6287c9085716 |
14 | 2a62d77da167 |
15 | 1443cd57e7ab |
hex | a1d14f7ee7f |
11120022122111 has 8 divisors (see below), whose sum is σ = 12825189342240. Its totient is φ = 9444003059808.
The previous prime is 11120022122101. The next prime is 11120022122113. The reversal of 11120022122111 is 11122122002111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11120022122111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11120022122111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120022122113) 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, 7287038636 + ... + 7287040161.
It is an arithmetic number, because the mean of its divisors is an integer number (1603148667780).
Almost surely, 211120022122111 is an apocalyptic number.
11120022122111 is a deficient number, since it is larger than the sum of its proper divisors (1705167220129).
11120022122111 is a wasteful number, since it uses less digits than its factorization.
11120022122111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14574078913.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11120022122111 its reverse (11122122002111), we get a palindrome (22242144124222).
The spelling of 11120022122111 in words is "eleven trillion, one hundred twenty billion, twenty-two million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •