Base | Representation |
---|---|
bin | 101100011011101111111010… |
… | …111100001101100010101101 |
3 | 221121221001120102002120011111 |
4 | 230123233322330031202231 |
5 | 201103234024313320223 |
6 | 1531343045021152021 |
7 | 56106460514631166 |
oct | 5433577274154255 |
9 | 847831512076144 |
10 | 195420927088813 |
11 | 572a3605801808 |
12 | 19b01a750bb611 |
13 | 850716430014a |
14 | 36385cd8d476d |
15 | 178d5305b030d |
hex | b1bbfaf0d8ad |
195420927088813 has 2 divisors, whose sum is σ = 195420927088814. Its totient is φ = 195420927088812.
The previous prime is 195420927088799. The next prime is 195420927088837. The reversal of 195420927088813 is 318880729024591.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 176938468519684 + 18482458569129 = 13301822^2 + 4299123^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-195420927088813 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (195420927088853) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 97710463544406 + 97710463544407.
It is an arithmetic number, because the mean of its divisors is an integer number (97710463544407).
Almost surely, 2195420927088813 is an apocalyptic number.
It is an amenable number.
195420927088813 is a deficient number, since it is larger than the sum of its proper divisors (1).
195420927088813 is an equidigital number, since it uses as much as digits as its factorization.
195420927088813 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69672960, while the sum is 67.
The spelling of 195420927088813 in words is "one hundred ninety-five trillion, four hundred twenty billion, nine hundred twenty-seven million, eighty-eight thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •