Base | Representation |
---|---|
bin | 1101000011111… |
… | …10101110011101 |
3 | 21122011210010012 |
4 | 12201332232131 |
5 | 211022232343 |
6 | 14512253005 |
7 | 2500223621 |
oct | 641765635 |
9 | 248153105 |
10 | 109570973 |
11 | 56939326 |
12 | 30841165 |
13 | 19914cc5 |
14 | 107a3181 |
15 | 9945718 |
hex | 687eb9d |
109570973 has 2 divisors, whose sum is σ = 109570974. Its totient is φ = 109570972.
The previous prime is 109570943. The next prime is 109571027. The reversal of 109570973 is 379075901.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 93354244 + 16216729 = 9662^2 + 4027^2 .
It is an emirp because it is prime and its reverse (379075901) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 109570973 - 220 = 108522397 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 109570973.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (109570913) 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 as a sum of consecutive naturals, namely, 54785486 + 54785487.
It is an arithmetic number, because the mean of its divisors is an integer number (54785487).
Almost surely, 2109570973 is an apocalyptic number.
It is an amenable number.
109570973 is a deficient number, since it is larger than the sum of its proper divisors (1).
109570973 is an equidigital number, since it uses as much as digits as its factorization.
109570973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 59535, while the sum is 41.
The square root of 109570973 is about 10467.6154400131. The cubic root of 109570973 is about 478.5182503111.
The spelling of 109570973 in words is "one hundred nine million, five hundred seventy thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •