Base | Representation |
---|---|
bin | 101100100011001101110011… |
… | …110010111100001110100101 |
3 | 221200202010001020022102002021 |
4 | 230203031303302330032211 |
5 | 201140140421241404312 |
6 | 1532414510154343141 |
7 | 56161524362041513 |
oct | 5443156362741645 |
9 | 850663036272067 |
10 | 195934055809957 |
11 | 57481191572773 |
12 | 19b853baa2aab1 |
13 | 854366b3ab26a |
14 | 365538a5cd4b3 |
15 | 179ba63abec07 |
hex | b23373cbc3a5 |
195934055809957 has 2 divisors, whose sum is σ = 195934055809958. Its totient is φ = 195934055809956.
The previous prime is 195934055809949. The next prime is 195934055809969. The reversal of 195934055809957 is 759908550439591.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 195738735123556 + 195320686401 = 13990666^2 + 441951^2 .
It is a cyclic number.
It is not a de Polignac number, because 195934055809957 - 23 = 195934055809949 is a prime.
It is a super-2 number, since 2×1959340558099572 (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 (195934055869957) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 97967027904978 + 97967027904979.
It is an arithmetic number, because the mean of its divisors is an integer number (97967027904979).
Almost surely, 2195934055809957 is an apocalyptic number.
It is an amenable number.
195934055809957 is a deficient number, since it is larger than the sum of its proper divisors (1).
195934055809957 is an equidigital number, since it uses as much as digits as its factorization.
195934055809957 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2755620000, while the sum is 79.
The spelling of 195934055809957 in words is "one hundred ninety-five trillion, nine hundred thirty-four billion, fifty-five million, eight hundred nine thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •