Base | Representation |
---|---|
bin | 1100110001000… |
… | …00110110011101 |
3 | 21110111200220201 |
4 | 12120200312131 |
5 | 204403324214 |
6 | 14343143501 |
7 | 2440146505 |
oct | 630406635 |
9 | 243450821 |
10 | 107089309 |
11 | 554a3868 |
12 | 2ba44b91 |
13 | 19256572 |
14 | 10318a05 |
15 | 9605274 |
hex | 6620d9d |
107089309 has 8 divisors (see below), whose sum is σ = 110081592. Its totient is φ = 104133120.
The previous prime is 107089303. The next prime is 107089313. The reversal of 107089309 is 903980701.
It can be written as a sum of positive squares in 4 ways, for example, as 1452025 + 105637284 = 1205^2 + 10278^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 107089309 - 211 = 107087261 is a prime.
It is a super-2 number, since 2×1070893092 = 22936240204194962, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107089303) 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 7 ways as a sum of consecutive naturals, for example, 2952 + ... + 14929.
It is an arithmetic number, because the mean of its divisors is an integer number (13760199).
Almost surely, 2107089309 is an apocalyptic number.
It is an amenable number.
107089309 is a deficient number, since it is larger than the sum of its proper divisors (2992283).
107089309 is a wasteful number, since it uses less digits than its factorization.
107089309 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18047.
The product of its (nonzero) digits is 13608, while the sum is 37.
The square root of 107089309 is about 10348.3964458268. The cubic root of 107089309 is about 474.8779874981.
The spelling of 107089309 in words is "one hundred seven million, eighty-nine thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •