Base | Representation |
---|---|
bin | 110011010001100110… |
… | …0000011110110010111 |
3 | 101112012220012200210011 |
4 | 1212203030003312113 |
5 | 3301002134430403 |
6 | 122330150541051 |
7 | 10645451545555 |
oct | 1464314036627 |
9 | 345186180704 |
10 | 110112030103 |
11 | 42775408a79 |
12 | 19410367787 |
13 | a4ca7932ca |
14 | 5488026bd5 |
15 | 2ce6d76a6d |
hex | 19a3303d97 |
110112030103 has 4 divisors (see below), whose sum is σ = 110540481840. Its totient is φ = 109683578368.
The previous prime is 110112030089. The next prime is 110112030107. The reversal of 110112030103 is 301030211011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301030211011 = 147451 ⋅2041561.
It is a cyclic number.
It is not a de Polignac number, because 110112030103 - 25 = 110112030071 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 (110112030107) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 214225483 + ... + 214225996.
It is an arithmetic number, because the mean of its divisors is an integer number (27635120460).
Almost surely, 2110112030103 is an apocalyptic number.
110112030103 is a deficient number, since it is larger than the sum of its proper divisors (428451737).
110112030103 is an equidigital number, since it uses as much as digits as its factorization.
110112030103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 428451736.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 110112030103 its reverse (301030211011), we get a palindrome (411142241114).
The spelling of 110112030103 in words is "one hundred ten billion, one hundred twelve million, thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •