Base | Representation |
---|---|
bin | 10111011100101… |
… | …11110101001001 |
3 | 111201010200100221 |
4 | 23232113311021 |
5 | 400324034414 |
6 | 31304030041 |
7 | 4605653512 |
oct | 1356276511 |
9 | 451120327 |
10 | 196705609 |
11 | a1042921 |
12 | 55a62321 |
13 | 319a2969 |
14 | 1c1a5a09 |
15 | 12408224 |
hex | bb97d49 |
196705609 has 2 divisors, whose sum is σ = 196705610. Its totient is φ = 196705608.
The previous prime is 196705603. The next prime is 196705627. The reversal of 196705609 is 906507691.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 123654400 + 73051209 = 11120^2 + 8547^2 .
It is an emirp because it is prime and its reverse (906507691) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 196705609 - 29 = 196705097 is a prime.
It is a super-2 number, since 2×1967056092 = 77386193224121762, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (196705603) 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, 98352804 + 98352805.
It is an arithmetic number, because the mean of its divisors is an integer number (98352805).
Almost surely, 2196705609 is an apocalyptic number.
It is an amenable number.
196705609 is a deficient number, since it is larger than the sum of its proper divisors (1).
196705609 is an equidigital number, since it uses as much as digits as its factorization.
196705609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 102060, while the sum is 43.
The square root of 196705609 is about 14025.1776815839. The cubic root of 196705609 is about 581.5748017179.
The spelling of 196705609 in words is "one hundred ninety-six million, seven hundred five thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •