Base | Representation |
---|---|
bin | 110011010001100110… |
… | …0010111101011001001 |
3 | 101112012220100211011122 |
4 | 1212203030113223021 |
5 | 3301002200030210 |
6 | 122330152405025 |
7 | 10645452334400 |
oct | 1464314275311 |
9 | 345186324148 |
10 | 110112111305 |
11 | 42775463a89 |
12 | 194103a6775 |
13 | a4ca7c1261 |
14 | 5488048637 |
15 | 2ce6d90b55 |
hex | 19a3317ac9 |
110112111305 has 12 divisors (see below), whose sum is σ = 153707518980. Its totient is φ = 75505447584.
The previous prime is 110112111299. The next prime is 110112111311. The reversal of 110112111305 is 503111211011.
It is an interprime number because it is at equal distance from previous prime (110112111299) and next prime (110112111311).
It can be written as a sum of positive squares in 2 ways, for example, as 80817392656 + 29294718649 = 284284^2 + 171157^2 .
It is not a de Polignac number, because 110112111305 - 210 = 110112110281 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 224718350 + ... + 224718839.
It is an arithmetic number, because the mean of its divisors is an integer number (12808959915).
Almost surely, 2110112111305 is an apocalyptic number.
It is an amenable number.
110112111305 is a deficient number, since it is larger than the sum of its proper divisors (43595407675).
110112111305 is an equidigital number, since it uses as much as digits as its factorization.
110112111305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 449437208 (or 449437201 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 17.
Adding to 110112111305 its reverse (503111211011), we get a palindrome (613223322316).
The spelling of 110112111305 in words is "one hundred ten billion, one hundred twelve million, one hundred eleven thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •