Base | Representation |
---|---|
bin | 110010111011100000… |
… | …0000100101001111001 |
3 | 101110022020020201120120 |
4 | 1211313000010221321 |
5 | 3242442344041134 |
6 | 122124425243453 |
7 | 10621210345626 |
oct | 1456700045171 |
9 | 343266221516 |
10 | 109370690169 |
11 | 424249a3344 |
12 | 19244033589 |
13 | a41000b520 |
14 | 54177ab34d |
15 | 2ca1c3a649 |
hex | 1977004a79 |
109370690169 has 16 divisors (see below), whose sum is σ = 160875464064. Its totient is φ = 65663452800.
The previous prime is 109370690129. The next prime is 109370690173. The reversal of 109370690169 is 961096073901.
It is not a de Polignac number, because 109370690169 - 29 = 109370689657 is a prime.
It is a super-2 number, since 2×1093706901692 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (109370690129) 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 15 ways as a sum of consecutive naturals, for example, 34198117 + ... + 34201314.
It is an arithmetic number, because the mean of its divisors is an integer number (10054716504).
Almost surely, 2109370690169 is an apocalyptic number.
It is an amenable number.
109370690169 is a deficient number, since it is larger than the sum of its proper divisors (51504773895).
109370690169 is a wasteful number, since it uses less digits than its factorization.
109370690169 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68399488.
The product of its (nonzero) digits is 551124, while the sum is 51.
The spelling of 109370690169 in words is "one hundred nine billion, three hundred seventy million, six hundred ninety thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •