Base | Representation |
---|---|
bin | 1101000011010… |
… | …10010011001101 |
3 | 21122000112100112 |
4 | 12201222103031 |
5 | 211012043214 |
6 | 14510405405 |
7 | 2466424661 |
oct | 641522315 |
9 | 248015315 |
10 | 109487309 |
11 | 56891488 |
12 | 30800865 |
13 | 198b5bb9 |
14 | 107808a1 |
15 | 992aa3e |
hex | 686a4cd |
109487309 has 2 divisors, whose sum is σ = 109487310. Its totient is φ = 109487308.
The previous prime is 109487251. The next prime is 109487341. The reversal of 109487309 is 903784901.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 55875625 + 53611684 = 7475^2 + 7322^2 .
It is an emirp because it is prime and its reverse (903784901) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-109487309 is a prime.
It is a super-2 number, since 2×1094873092 = 23974941664122962, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (109487359) 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 as a sum of consecutive naturals, namely, 54743654 + 54743655.
It is an arithmetic number, because the mean of its divisors is an integer number (54743655).
Almost surely, 2109487309 is an apocalyptic number.
It is an amenable number.
109487309 is a deficient number, since it is larger than the sum of its proper divisors (1).
109487309 is an equidigital number, since it uses as much as digits as its factorization.
109487309 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54432, while the sum is 41.
The square root of 109487309 is about 10463.6183512206. The cubic root of 109487309 is about 478.3964268519.
The spelling of 109487309 in words is "one hundred nine million, four hundred eighty-seven thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •