Base | Representation |
---|---|
bin | 10111011110011… |
… | …10100111110101 |
3 | 111201120002020002 |
4 | 23233032213311 |
5 | 400403230122 |
6 | 31312521045 |
7 | 4610610023 |
oct | 1357164765 |
9 | 451502202 |
10 | 196930037 |
11 | a11864a7 |
12 | 55b50185 |
13 | 31a50b65 |
14 | 1c223713 |
15 | 1244e992 |
hex | bbce9f5 |
196930037 has 2 divisors, whose sum is σ = 196930038. Its totient is φ = 196930036.
The previous prime is 196930031. The next prime is 196930043. The reversal of 196930037 is 730039691.
It is a balanced prime because it is at equal distance from previous prime (196930031) and next prime (196930043).
It can be written as a sum of positive squares in only one way, i.e., 173027716 + 23902321 = 13154^2 + 4889^2 .
It is an emirp because it is prime and its reverse (730039691) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 196930037 - 212 = 196925941 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (196930031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 98465018 + 98465019.
It is an arithmetic number, because the mean of its divisors is an integer number (98465019).
Almost surely, 2196930037 is an apocalyptic number.
It is an amenable number.
196930037 is a deficient number, since it is larger than the sum of its proper divisors (1).
196930037 is an equidigital number, since it uses as much as digits as its factorization.
196930037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30618, while the sum is 38.
The square root of 196930037 is about 14033.1762976170. The cubic root of 196930037 is about 581.7958970269.
The spelling of 196930037 in words is "one hundred ninety-six million, nine hundred thirty thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •