Base | Representation |
---|---|
bin | 10111011100100… |
… | …11010100000001 |
3 | 111201002201222121 |
4 | 23232103110001 |
5 | 400322441410 |
6 | 31303404241 |
7 | 4605545536 |
oct | 1356232401 |
9 | 451081877 |
10 | 196687105 |
11 | a102aa2a |
12 | 55a53681 |
13 | 31997404 |
14 | 1c19cd8d |
15 | 124029da |
hex | bb93501 |
196687105 has 4 divisors (see below), whose sum is σ = 236024532. Its totient is φ = 157349680.
The previous prime is 196687103. The next prime is 196687129. The reversal of 196687105 is 501786691.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 501786691 = 7 ⋅71683813.
It can be written as a sum of positive squares in 2 ways, for example, as 132158016 + 64529089 = 11496^2 + 8033^2 .
It is not a de Polignac number, because 196687105 - 21 = 196687103 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (196687103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19668706 + ... + 19668715.
It is an arithmetic number, because the mean of its divisors is an integer number (59006133).
Almost surely, 2196687105 is an apocalyptic number.
It is an amenable number.
196687105 is a deficient number, since it is larger than the sum of its proper divisors (39337427).
196687105 is an equidigital number, since it uses as much as digits as its factorization.
196687105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39337426.
The product of its (nonzero) digits is 90720, while the sum is 43.
The square root of 196687105 is about 14024.5179952824. The cubic root of 196687105 is about 581.5565649941.
The spelling of 196687105 in words is "one hundred ninety-six million, six hundred eighty-seven thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •