Base | Representation |
---|---|
bin | 110000000110101001… |
… | …0101010111001001101 |
3 | 100212122022100011011012 |
4 | 1200031102222321031 |
5 | 3143030331310242 |
6 | 115242324535005 |
7 | 10314632216141 |
oct | 1401522527115 |
9 | 325568304135 |
10 | 103302213197 |
11 | 3a8a0451817 |
12 | 1802b851465 |
13 | 99839b8251 |
14 | 4ddd855221 |
15 | 2a490c8282 |
hex | 180d4aae4d |
103302213197 has 2 divisors, whose sum is σ = 103302213198. Its totient is φ = 103302213196.
The previous prime is 103302213103. The next prime is 103302213221. The reversal of 103302213197 is 791312203301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 57383723401 + 45918489796 = 239549^2 + 214286^2 .
It is a cyclic number.
It is not a de Polignac number, because 103302213197 - 210 = 103302212173 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103302213097) 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, 51651106598 + 51651106599.
It is an arithmetic number, because the mean of its divisors is an integer number (51651106599).
Almost surely, 2103302213197 is an apocalyptic number.
It is an amenable number.
103302213197 is a deficient number, since it is larger than the sum of its proper divisors (1).
103302213197 is an equidigital number, since it uses as much as digits as its factorization.
103302213197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804, while the sum is 32.
Adding to 103302213197 its reverse (791312203301), we get a palindrome (894614416498).
The spelling of 103302213197 in words is "one hundred three billion, three hundred two million, two hundred thirteen thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •