Base | Representation |
---|---|
bin | 1011011000110010100… |
… | …0100011010011010001 |
3 | 200200221222221112001022 |
4 | 2312030220203103101 |
5 | 11201124020001123 |
6 | 225512245245225 |
7 | 20063652540644 |
oct | 2661450432321 |
9 | 620858845038 |
10 | 195632968913 |
11 | 75a707900a8 |
12 | 31ab9103815 |
13 | 155a9660605 |
14 | 967c109a5b |
15 | 514ed9e1c8 |
hex | 2d8ca234d1 |
195632968913 has 2 divisors, whose sum is σ = 195632968914. Its totient is φ = 195632968912.
The previous prime is 195632968903. The next prime is 195632968991. The reversal of 195632968913 is 319869236591.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 151090022209 + 44542946704 = 388703^2 + 211052^2 .
It is a cyclic number.
It is not a de Polignac number, because 195632968913 - 210 = 195632967889 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (195632968903) 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 as a sum of consecutive naturals, namely, 97816484456 + 97816484457.
It is an arithmetic number, because the mean of its divisors is an integer number (97816484457).
Almost surely, 2195632968913 is an apocalyptic number.
It is an amenable number.
195632968913 is a deficient number, since it is larger than the sum of its proper divisors (1).
195632968913 is an equidigital number, since it uses as much as digits as its factorization.
195632968913 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 18895680, while the sum is 62.
The spelling of 195632968913 in words is "one hundred ninety-five billion, six hundred thirty-two million, nine hundred sixty-eight thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •