Base | Representation |
---|---|
bin | 1101000001110… |
… | …11100101111001 |
3 | 21121122210220202 |
4 | 12200323211321 |
5 | 210434432433 |
6 | 14502331545 |
7 | 2465000132 |
oct | 640734571 |
9 | 247583822 |
10 | 109295993 |
11 | 56770774 |
12 | 30729bb5 |
13 | 19849ab1 |
14 | 10730c89 |
15 | 98ddee8 |
hex | 683b979 |
109295993 has 2 divisors, whose sum is σ = 109295994. Its totient is φ = 109295992.
The previous prime is 109295971. The next prime is 109296001. The reversal of 109295993 is 399592901.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91546624 + 17749369 = 9568^2 + 4213^2 .
It is an emirp because it is prime and its reverse (399592901) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 109295993 - 26 = 109295929 is a prime.
It is a super-2 number, since 2×1092959932 = 23891228171712098, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (109295933) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 54647996 + 54647997.
It is an arithmetic number, because the mean of its divisors is an integer number (54647997).
Almost surely, 2109295993 is an apocalyptic number.
It is an amenable number.
109295993 is a deficient number, since it is larger than the sum of its proper divisors (1).
109295993 is an equidigital number, since it uses as much as digits as its factorization.
109295993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 196830, while the sum is 47.
The square root of 109295993 is about 10454.4723922348. The cubic root of 109295993 is about 478.1176175146.
The spelling of 109295993 in words is "one hundred nine million, two hundred ninety-five thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •