Base | Representation |
---|---|
bin | 110010110000110000… |
… | …0100100000111101111 |
3 | 101102101002202022002011 |
4 | 1211201200210013233 |
5 | 3241223041441121 |
6 | 122024544542051 |
7 | 10606241431414 |
oct | 1454140440757 |
9 | 342332668064 |
10 | 109010108911 |
11 | 4225a401300 |
12 | 19163321927 |
13 | a3833bc032 |
14 | 53c194810b |
15 | 2c802617e1 |
hex | 19618241ef |
109010108911 has 6 divisors (see below), whose sum is σ = 119821028936. Its totient is φ = 99100098900.
The previous prime is 109010108849. The next prime is 109010108927. The reversal of 109010108911 is 119801010901.
It is not a de Polignac number, because 109010108911 - 215 = 109010076143 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 (109010108941) 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 5 ways as a sum of consecutive naturals, for example, 450454875 + ... + 450455116.
Almost surely, 2109010108911 is an apocalyptic number.
109010108911 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
109010108911 is a deficient number, since it is larger than the sum of its proper divisors (10810920025).
109010108911 is an equidigital number, since it uses as much as digits as its factorization.
109010108911 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 900910013 (or 900910002 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 31.
The spelling of 109010108911 in words is "one hundred nine billion, ten million, one hundred eight thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •