Base | Representation |
---|---|
bin | 1011011100111110001… |
… | …0111000110100111011 |
3 | 200210212020021221100110 |
4 | 2313033202320310323 |
5 | 11210423410321231 |
6 | 230215510235403 |
7 | 20133533434350 |
oct | 2671742706473 |
9 | 623766257313 |
10 | 196755557691 |
11 | 76497423720 |
12 | 32171055b63 |
13 | 157280bcb24 |
14 | 9747248627 |
15 | 51b86e8046 |
hex | 2dcf8b8d3b |
196755557691 has 32 divisors (see below), whose sum is σ = 327188187648. Its totient is φ = 102175050240.
The previous prime is 196755557683. The next prime is 196755557707.
196755557691 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 196755557691 - 23 = 196755557683 is a prime.
It is not an unprimeable number, because it can be changed into a prime (196755557611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 522201 + ... + 816213.
It is an arithmetic number, because the mean of its divisors is an integer number (10224630864).
Almost surely, 2196755557691 is an apocalyptic number.
196755557691 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
196755557691 is a deficient number, since it is larger than the sum of its proper divisors (130432629957).
196755557691 is a wasteful number, since it uses less digits than its factorization.
196755557691 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 296931.
The product of its digits is 89302500, while the sum is 66.
The spelling of 196755557691 in words is "one hundred ninety-six billion, seven hundred fifty-five million, five hundred fifty-seven thousand, six hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •