Base | Representation |
---|---|
bin | 101100101110011000000011… |
… | …100111001101010011101101 |
3 | 221210110102120222222201222022 |
4 | 230232120003213031103231 |
5 | 201240222043021110411 |
6 | 1534203102431555525 |
7 | 56301114322133642 |
oct | 5456300347152355 |
9 | 853412528881868 |
10 | 196700972831981 |
11 | 577474611a8452 |
12 | 1a089b7198bba5 |
13 | 859aa8c347607 |
14 | 3680540ca3dc9 |
15 | 17b199c7a2edb |
hex | b2e6039cd4ed |
196700972831981 has 2 divisors, whose sum is σ = 196700972831982. Its totient is φ = 196700972831980.
The previous prime is 196700972831953. The next prime is 196700972832037. The reversal of 196700972831981 is 189138279007691.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 193379867519881 + 3321105312100 = 13906109^2 + 1822390^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-196700972831981 is a prime.
It is a super-2 number, since 2×1967009728319812 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (196700972831941) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 98350486415990 + 98350486415991.
It is an arithmetic number, because the mean of its divisors is an integer number (98350486415991).
Almost surely, 2196700972831981 is an apocalyptic number.
It is an amenable number.
196700972831981 is a deficient number, since it is larger than the sum of its proper divisors (1).
196700972831981 is an equidigital number, since it uses as much as digits as its factorization.
196700972831981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 82301184, while the sum is 71.
The spelling of 196700972831981 in words is "one hundred ninety-six trillion, seven hundred billion, nine hundred seventy-two million, eight hundred thirty-one thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •