Base | Representation |
---|---|
bin | 10111011100101… |
… | …11000001101001 |
3 | 111201010111211212 |
4 | 23232113001221 |
5 | 400323433223 |
6 | 31304002505 |
7 | 4605641063 |
oct | 1356270151 |
9 | 451114755 |
10 | 196702313 |
11 | a10403a5 |
12 | 55a60435 |
13 | 319a1302 |
14 | 1c1a4733 |
15 | 12407278 |
hex | bb97069 |
196702313 has 2 divisors, whose sum is σ = 196702314. Its totient is φ = 196702312.
The previous prime is 196702301. The next prime is 196702321. The reversal of 196702313 is 313207691.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110082064 + 86620249 = 10492^2 + 9307^2 .
It is an emirp because it is prime and its reverse (313207691) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 196702313 - 28 = 196702057 is a prime.
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 196702313.
It is not a weakly prime, because it can be changed into another prime (196702013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 98351156 + 98351157.
It is an arithmetic number, because the mean of its divisors is an integer number (98351157).
Almost surely, 2196702313 is an apocalyptic number.
It is an amenable number.
196702313 is a deficient number, since it is larger than the sum of its proper divisors (1).
196702313 is an equidigital number, since it uses as much as digits as its factorization.
196702313 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.
The square root of 196702313 is about 14025.0601781240. The cubic root of 196702313 is about 581.5715534098.
The spelling of 196702313 in words is "one hundred ninety-six million, seven hundred two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •