Base | Representation |
---|---|
bin | 10111011101100… |
… | …10000011010101 |
3 | 111201100010200212 |
4 | 23232302003111 |
5 | 400341004023 |
6 | 31310215205 |
7 | 4606611605 |
oct | 1356620325 |
9 | 451303625 |
10 | 196813013 |
11 | a1106591 |
12 | 55ab4505 |
13 | 31a0c807 |
14 | 1c1d2c05 |
15 | 12429e78 |
hex | bbb20d5 |
196813013 has 2 divisors, whose sum is σ = 196813014. Its totient is φ = 196813012.
The previous prime is 196812989. The next prime is 196813031. The reversal of 196813013 is 310318691.
Together with next prime (196813031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 111028369 + 85784644 = 10537^2 + 9262^2 .
It is a cyclic number.
It is not a de Polignac number, because 196813013 - 26 = 196812949 is a prime.
It is a super-2 number, since 2×1968130132 = 77470724172276338, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (196813033) by changing a digit.
It is a good prime.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 98406506 + 98406507.
It is an arithmetic number, because the mean of its divisors is an integer number (98406507).
Almost surely, 2196813013 is an apocalyptic number.
It is an amenable number.
196813013 is a deficient number, since it is larger than the sum of its proper divisors (1).
196813013 is an equidigital number, since it uses as much as digits as its factorization.
196813013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 32.
The square root of 196813013 is about 14029.0061301576. The cubic root of 196813013 is about 581.6806317705.
The spelling of 196813013 in words is "one hundred ninety-six million, eight hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •