Base | Representation |
---|---|
bin | 110010110100000001… |
… | …1110011101101010101 |
3 | 101102122202112220112100 |
4 | 1211220003303231111 |
5 | 3241434210323333 |
6 | 122043512312313 |
7 | 10612044535062 |
oct | 1455003635525 |
9 | 342582486470 |
10 | 109120011093 |
11 | 42306446455 |
12 | 191940a2699 |
13 | a3a00bba02 |
14 | 53d2395c69 |
15 | 2c89c20213 |
hex | 19680f3b55 |
109120011093 has 12 divisors (see below), whose sum is σ = 161877734668. Its totient is φ = 70780547520.
The previous prime is 109120011079. The next prime is 109120011097. The reversal of 109120011093 is 390110021901.
It can be written as a sum of positive squares in 2 ways, for example, as 71948942289 + 37171068804 = 268233^2 + 192798^2 .
It is not a de Polignac number, because 109120011093 - 221 = 109117913941 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 (109120011097) 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, 163843528 + ... + 163844193.
Almost surely, 2109120011093 is an apocalyptic number.
It is an amenable number.
109120011093 is a deficient number, since it is larger than the sum of its proper divisors (52757723575).
109120011093 is a wasteful number, since it uses less digits than its factorization.
109120011093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 327687764 (or 327687761 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 27.
Adding to 109120011093 its reverse (390110021901), we get a palindrome (499230032994).
The spelling of 109120011093 in words is "one hundred nine billion, one hundred twenty million, eleven thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •