Base | Representation |
---|---|
bin | 1101000100101… |
… | …01011101000101 |
3 | 21122100111211012 |
4 | 12202111131011 |
5 | 211033222234 |
6 | 14514252005 |
7 | 2501062214 |
oct | 642253505 |
9 | 248314735 |
10 | 109664069 |
11 | 569a2269 |
12 | 30887005 |
13 | 199484a8 |
14 | 107c907b |
15 | 99630ce |
hex | 6895745 |
109664069 has 4 divisors (see below), whose sum is σ = 114432096. Its totient is φ = 104896044.
The previous prime is 109664033. The next prime is 109664101. The reversal of 109664069 is 960466901.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 109664069 - 212 = 109659973 is a prime.
It is a super-2 number, since 2×1096640692 = 24052416059273522, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109664969) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2383979 + ... + 2384024.
It is an arithmetic number, because the mean of its divisors is an integer number (28608024).
Almost surely, 2109664069 is an apocalyptic number.
It is an amenable number.
109664069 is a deficient number, since it is larger than the sum of its proper divisors (4768027).
109664069 is an equidigital number, since it uses as much as digits as its factorization.
109664069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4768026.
The product of its (nonzero) digits is 69984, while the sum is 41.
The square root of 109664069 is about 10472.0613539074. The cubic root of 109664069 is about 478.6537348685.
The spelling of 109664069 in words is "one hundred nine million, six hundred sixty-four thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •