Base | Representation |
---|---|
bin | 11001000010010101110010… |
… | …101001010100010001010111 |
3 | 112102212121022121022100020101 |
4 | 121002111302221110101113 |
5 | 103413033334000013421 |
6 | 1030104430544314531 |
7 | 32123221003025203 |
oct | 3102256251242127 |
9 | 472777277270211 |
10 | 110112000001111 |
11 | 320a3267428789 |
12 | 1042453a012a47 |
13 | 4959694c46074 |
14 | 1d296409bdb03 |
15 | cae3ec1bd191 |
hex | 642572a54457 |
110112000001111 has 4 divisors (see below), whose sum is σ = 110115362335000. Its totient is φ = 110108637667224.
The previous prime is 110112000001063. The next prime is 110112000001141. The reversal of 110112000001111 is 111100000211011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 110112000001111 - 27 = 110112000000983 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110112000001141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1681117821 + ... + 1681183318.
It is an arithmetic number, because the mean of its divisors is an integer number (27528840583750).
Almost surely, 2110112000001111 is an apocalyptic number.
110112000001111 is a deficient number, since it is larger than the sum of its proper divisors (3362333889).
110112000001111 is an equidigital number, since it uses as much as digits as its factorization.
110112000001111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3362333888.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 110112000001111 its reverse (111100000211011), we get a palindrome (221212000212122).
The spelling of 110112000001111 in words is "one hundred ten trillion, one hundred twelve billion, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •