Base | Representation |
---|---|
bin | 110011011001101100… |
… | …1101001100111001101 |
3 | 101112220212000121220101 |
4 | 1212303121221213031 |
5 | 3302031302344414 |
6 | 122413144451101 |
7 | 10655263520635 |
oct | 1466331514715 |
9 | 345825017811 |
10 | 110384028109 |
11 | 428a49a7113 |
12 | 19487479a91 |
13 | a541c38684 |
14 | 54b21cb6c5 |
15 | 2d10ba3a74 |
hex | 19b36699cd |
110384028109 has 8 divisors (see below), whose sum is σ = 110828542968. Its totient is φ = 109939630080.
The previous prime is 110384028049. The next prime is 110384028169. The reversal of 110384028109 is 901820483011.
It is an interprime number because it is at equal distance from previous prime (110384028049) and next prime (110384028169).
It can be written as a sum of positive squares in 4 ways, for example, as 51720766084 + 58663262025 = 227422^2 + 242205^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110384028109 - 27 = 110384027981 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 (110384028169) 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, 2206279 + ... + 2255755.
It is an arithmetic number, because the mean of its divisors is an integer number (13853567871).
Almost surely, 2110384028109 is an apocalyptic number.
It is an amenable number.
110384028109 is a deficient number, since it is larger than the sum of its proper divisors (444514859).
110384028109 is an equidigital number, since it uses as much as digits as its factorization.
110384028109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58415.
The product of its (nonzero) digits is 13824, while the sum is 37.
The spelling of 110384028109 in words is "one hundred ten billion, three hundred eighty-four million, twenty-eight thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •