Base | Representation |
---|---|
bin | 1100010001111… |
… | …01001101111101 |
3 | 21011211111210112 |
4 | 12020331031331 |
5 | 202332324242 |
6 | 14115515405 |
7 | 2360403122 |
oct | 610751575 |
9 | 234744715 |
10 | 103011197 |
11 | 53168923 |
12 | 2a5b8b65 |
13 | 18459293 |
14 | d976749 |
15 | 909bc82 |
hex | 623d37d |
103011197 has 2 divisors, whose sum is σ = 103011198. Its totient is φ = 103011196.
The previous prime is 103011193. The next prime is 103011199. The reversal of 103011197 is 791110301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91948921 + 11062276 = 9589^2 + 3326^2 .
It is an emirp because it is prime and its reverse (791110301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103011197 - 22 = 103011193 is a prime.
It is a super-2 number, since 2×1030111972 = 21222613414745618, which contains 22 as substring.
Together with 103011199, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103011193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51505598 + 51505599.
It is an arithmetic number, because the mean of its divisors is an integer number (51505599).
Almost surely, 2103011197 is an apocalyptic number.
It is an amenable number.
103011197 is a deficient number, since it is larger than the sum of its proper divisors (1).
103011197 is an equidigital number, since it uses as much as digits as its factorization.
103011197 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 189, while the sum is 23.
The square root of 103011197 is about 10149.4431866975. The cubic root of 103011197 is about 468.7718000647.
Adding to 103011197 its reverse (791110301), we get a palindrome (894121498).
The spelling of 103011197 in words is "one hundred three million, eleven thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •