Base | Representation |
---|---|
bin | 10111010111111… |
… | …10000010110101 |
3 | 111122221200022000 |
4 | 23223332002311 |
5 | 400143410301 |
6 | 31242325513 |
7 | 4600421163 |
oct | 1353760265 |
9 | 448850260 |
10 | 196075701 |
11 | a0752638 |
12 | 557b9899 |
13 | 31812033 |
14 | 1c080233 |
15 | 12331786 |
hex | bafe0b5 |
196075701 has 32 divisors (see below), whose sum is σ = 296632320. Its totient is φ = 127976112.
The previous prime is 196075661. The next prime is 196075727. The reversal of 196075701 is 107570691.
It is not a de Polignac number, because 196075701 - 29 = 196075189 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (196073701) 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 in 31 ways as a sum of consecutive naturals, for example, 511756 + ... + 512138.
It is an arithmetic number, because the mean of its divisors is an integer number (9269760).
Almost surely, 2196075701 is an apocalyptic number.
It is an amenable number.
196075701 is a deficient number, since it is larger than the sum of its proper divisors (100556619).
196075701 is a wasteful number, since it uses less digits than its factorization.
196075701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 742 (or 736 counting only the distinct ones).
The product of its (nonzero) digits is 13230, while the sum is 36.
The square root of 196075701 is about 14002.7033461400. The cubic root of 196075701 is about 580.9533478952.
The spelling of 196075701 in words is "one hundred ninety-six million, seventy-five thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •