Base | Representation |
---|---|
bin | 11001000010010100000001… |
… | …111111100100111011011111 |
3 | 112102212102102212221220100110 |
4 | 121002110001333210323133 |
5 | 103413021001130323403 |
6 | 1030103515231301103 |
7 | 32123123113256226 |
oct | 3102240177447337 |
9 | 472772385856313 |
10 | 110110110011103 |
11 | 320a248759a274 |
12 | 104240b107a793 |
13 | 4959453508797 |
14 | 1d2950199dcbd |
15 | cae33b2db103 |
hex | 642501fe4edf |
110110110011103 has 8 divisors (see below), whose sum is σ = 150781411907248. Its totient is φ = 71422774061184.
The previous prime is 110110110011101. The next prime is 110110110011113. The reversal of 110110110011103 is 301110011011011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110110110011103 - 21 = 110110110011101 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 (110110110011101) 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, 495991486426 + ... + 495991486647.
It is an arithmetic number, because the mean of its divisors is an integer number (18847676488406).
Almost surely, 2110110110011103 is an apocalyptic number.
110110110011103 is a deficient number, since it is larger than the sum of its proper divisors (40671301896145).
110110110011103 is an equidigital number, since it uses as much as digits as its factorization.
110110110011103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 991982973113.
The product of its (nonzero) digits is 3, while the sum is 12.
Adding to 110110110011103 its reverse (301110011011011), we get a palindrome (411220121022114).
The spelling of 110110110011103 in words is "one hundred ten trillion, one hundred ten billion, one hundred ten million, eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •