Base | Representation |
---|---|
bin | 1010000110110011110111… |
… | …1110001101000000000111 |
3 | 1110100022022202102110101020 |
4 | 2201230331332031000013 |
5 | 2424030110222023421 |
6 | 35344500522402223 |
7 | 2224552460331615 |
oct | 241547576150007 |
9 | 43308282373336 |
10 | 11112120111111 |
11 | 35a4695123968 |
12 | 12b572a660373 |
13 | 627b39c30976 |
14 | 2a5b8815c6b5 |
15 | 1440b998cdc6 |
hex | a1b3df8d007 |
11112120111111 has 12 divisors (see below), whose sum is σ = 15738965971752. Its totient is φ = 6972310657408.
The previous prime is 11112120111109. The next prime is 11112120111139. The reversal of 11112120111111 is 11111102121111.
It is a happy number.
11112120111111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11112120111111 - 21 = 11112120111109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11112120111101) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6408372900 + ... + 6408374633.
It is an arithmetic number, because the mean of its divisors is an integer number (1311580497646).
Almost surely, 211112120111111 is an apocalyptic number.
11112120111111 is a deficient number, since it is larger than the sum of its proper divisors (4626845860641).
11112120111111 is a wasteful number, since it uses less digits than its factorization.
11112120111111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12816747570 (or 12816747553 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 15.
Adding to 11112120111111 its reverse (11111102121111), we get a palindrome (22223222232222).
The spelling of 11112120111111 in words is "eleven trillion, one hundred twelve billion, one hundred twenty million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •