Base | Representation |
---|---|
bin | 1100110110001… |
… | …00101001000101 |
3 | 21111202210012102 |
4 | 12123010221011 |
5 | 210041311242 |
6 | 14405401445 |
7 | 2445642446 |
oct | 633045105 |
9 | 244683172 |
10 | 107760197 |
11 | 55911916 |
12 | 30109285 |
13 | 1942ca3c |
14 | 104512cd |
15 | 96d8e32 |
hex | 66c4a45 |
107760197 has 2 divisors, whose sum is σ = 107760198. Its totient is φ = 107760196.
The previous prime is 107760181. The next prime is 107760203. The reversal of 107760197 is 791067701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 107516161 + 244036 = 10369^2 + 494^2 .
It is an emirp because it is prime and its reverse (791067701) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 107760197 - 24 = 107760181 is a prime.
It is a super-2 number, since 2×1077601972 = 23224520114957618, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 107760197.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (107760397) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53880098 + 53880099.
It is an arithmetic number, because the mean of its divisors is an integer number (53880099).
Almost surely, 2107760197 is an apocalyptic number.
It is an amenable number.
107760197 is a deficient number, since it is larger than the sum of its proper divisors (1).
107760197 is an equidigital number, since it uses as much as digits as its factorization.
107760197 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18522, while the sum is 38.
The square root of 107760197 is about 10380.7609066002. The cubic root of 107760197 is about 475.8675881608.
The spelling of 107760197 in words is "one hundred seven million, seven hundred sixty thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.334 sec. • engine limits •