Base | Representation |
---|---|
bin | 11001000010010101111000… |
… | …101010100110101101111111 |
3 | 112102212121120122100201120011 |
4 | 121002111320222212231333 |
5 | 103413034040324031421 |
6 | 1030104444553204051 |
7 | 32123223340356565 |
oct | 3102257052465577 |
9 | 472777518321504 |
10 | 110112101002111 |
11 | 320a330944328a |
12 | 10424567a00627 |
13 | 49596acb4a380 |
14 | 1d29650191a35 |
15 | cae405ebe4e1 |
hex | 642578aa6b7f |
110112101002111 has 16 divisors (see below), whose sum is σ = 118979318797024. Its totient is φ = 101301704884224.
The previous prime is 110112101002109. The next prime is 110112101002121. The reversal of 110112101002111 is 111200101211011.
It is not a de Polignac number, because 110112101002111 - 21 = 110112101002109 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110112101002091 and 110112101002100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110112101002121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24573055 + ... + 28706431.
It is an arithmetic number, because the mean of its divisors is an integer number (7436207424814).
Almost surely, 2110112101002111 is an apocalyptic number.
110112101002111 is a deficient number, since it is larger than the sum of its proper divisors (8867217794913).
110112101002111 is a wasteful number, since it uses less digits than its factorization.
110112101002111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4140250.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 110112101002111 its reverse (111200101211011), we get a palindrome (221312202213122).
The spelling of 110112101002111 in words is "one hundred ten trillion, one hundred twelve billion, one hundred one million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •