Base | Representation |
---|---|
bin | 110010110011101010… |
… | …0011100000111011010 |
3 | 101102121220012001001112 |
4 | 1211213110130013122 |
5 | 3241423020444230 |
6 | 122042350220322 |
7 | 10611534146534 |
oct | 1454724340732 |
9 | 342556161045 |
10 | 109107593690 |
11 | 422aa435037 |
12 | 1918bab46a2 |
13 | a39a661a34 |
14 | 53d0882854 |
15 | 2c88abad95 |
hex | 196751c1da |
109107593690 has 8 divisors (see below), whose sum is σ = 196393668660. Its totient is φ = 43643037472.
The previous prime is 109107593687. The next prime is 109107593701. The reversal of 109107593690 is 96395701901.
It can be written as a sum of positive squares in 2 ways, for example, as 102233028121 + 6874565569 = 319739^2 + 82913^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1091075936902 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 5455379675 + ... + 5455379694.
Almost surely, 2109107593690 is an apocalyptic number.
109107593690 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
109107593690 is a deficient number, since it is larger than the sum of its proper divisors (87286074970).
109107593690 is a wasteful number, since it uses less digits than its factorization.
109107593690 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10910759376.
The product of its (nonzero) digits is 459270, while the sum is 50.
The spelling of 109107593690 in words is "one hundred nine billion, one hundred seven million, five hundred ninety-three thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •