Base | Representation |
---|---|
bin | 110010110011001000… |
… | …1101110110010001011 |
3 | 101102120200021121011002 |
4 | 1211212101232302023 |
5 | 3241404031402012 |
6 | 122040523325215 |
7 | 10611232414514 |
oct | 1454621566213 |
9 | 342520247132 |
10 | 109090106507 |
11 | 422a0580718 |
12 | 1918608080b |
13 | a396b4b2a5 |
14 | 53cc40da0b |
15 | 2c872b47c2 |
hex | 196646ec8b |
109090106507 has 12 divisors (see below), whose sum is σ = 120041457480. Its totient is φ = 98855098848.
The previous prime is 109090106467. The next prime is 109090106527. The reversal of 109090106507 is 705601090901.
It is not a de Polignac number, because 109090106507 - 210 = 109090105483 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (109090106527) 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 11 ways as a sum of consecutive naturals, for example, 5416778 + ... + 5436879.
It is an arithmetic number, because the mean of its divisors is an integer number (10003454790).
Almost surely, 2109090106507 is an apocalyptic number.
109090106507 is a deficient number, since it is larger than the sum of its proper divisors (10951350973).
109090106507 is a wasteful number, since it uses less digits than its factorization.
109090106507 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10853722 (or 10853699 counting only the distinct ones).
The product of its (nonzero) digits is 17010, while the sum is 38.
The spelling of 109090106507 in words is "one hundred nine billion, ninety million, one hundred six thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •