Base | Representation |
---|---|
bin | 11001000000110111101111… |
… | …010011000101111011100111 |
3 | 112102111221122120210001000220 |
4 | 121000313233103011323213 |
5 | 103404410023100041403 |
6 | 1025550210011335423 |
7 | 32113014302106624 |
oct | 3100675723057347 |
9 | 472457576701026 |
10 | 110011012112103 |
11 | 320644543a0a93 |
12 | 10408a55451573 |
13 | 494ccbc879b1b |
14 | 1d247c068534b |
15 | cab98b395953 |
hex | 640def4c5ee7 |
110011012112103 has 8 divisors (see below), whose sum is σ = 147801054441216. Its totient is φ = 72780822262200.
The previous prime is 110011012112101. The next prime is 110011012112123. The reversal of 110011012112103 is 301211210110011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110011012112103 - 21 = 110011012112101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110011012112101) 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, 139963119343 + ... + 139963120128.
It is an arithmetic number, because the mean of its divisors is an integer number (18475131805152).
Almost surely, 2110011012112103 is an apocalyptic number.
110011012112103 is a deficient number, since it is larger than the sum of its proper divisors (37790042329113).
110011012112103 is a wasteful number, since it uses less digits than its factorization.
110011012112103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 279926239605.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 110011012112103 its reverse (301211210110011), we get a palindrome (411222222222114).
The spelling of 110011012112103 in words is "one hundred ten trillion, eleven billion, twelve million, one hundred twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •