Base | Representation |
---|---|
bin | 110011010001100000… |
… | …0011110101001100101 |
3 | 101112012200111110020102 |
4 | 1212203000132221211 |
5 | 3301000400303044 |
6 | 122330001513445 |
7 | 10645414002440 |
oct | 1464300365145 |
9 | 345180443212 |
10 | 110108994149 |
11 | 42773725020 |
12 | 1940b342885 |
13 | a4c9c6c49b |
14 | 5487876657 |
15 | 2ce697724e |
hex | 19a301ea65 |
110108994149 has 8 divisors (see below), whose sum is σ = 137278746048. Its totient is φ = 85799216160.
The previous prime is 110108994131. The next prime is 110108994211. The reversal of 110108994149 is 941499801011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-110108994149 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 (110108994109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 714993392 + ... + 714993545.
It is an arithmetic number, because the mean of its divisors is an integer number (17159843256).
Almost surely, 2110108994149 is an apocalyptic number.
It is an amenable number.
110108994149 is a deficient number, since it is larger than the sum of its proper divisors (27169751899).
110108994149 is a wasteful number, since it uses less digits than its factorization.
110108994149 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1429986955.
The product of its (nonzero) digits is 93312, while the sum is 47.
The spelling of 110108994149 in words is "one hundred ten billion, one hundred eight million, nine hundred ninety-four thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •