Base | Representation |
---|---|
bin | 1011011100100000011… |
… | …0000111101011001101 |
3 | 200210112112010012110022 |
4 | 2313020012013223031 |
5 | 11210144411411241 |
6 | 230155243351525 |
7 | 20130455213621 |
oct | 2671006075315 |
9 | 623475105408 |
10 | 196630575821 |
11 | 76432919a19 |
12 | 321372225a5 |
13 | 15708240464 |
14 | 97347d3181 |
15 | 51ac75b54b |
hex | 2dc8187acd |
196630575821 has 2 divisors, whose sum is σ = 196630575822. Its totient is φ = 196630575820.
The previous prime is 196630575797. The next prime is 196630575829. The reversal of 196630575821 is 128575036691.
It is a happy number.
196630575821 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 188108701225 + 8521874596 = 433715^2 + 92314^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-196630575821 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (196630575829) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 98315287910 + 98315287911.
It is an arithmetic number, because the mean of its divisors is an integer number (98315287911).
Almost surely, 2196630575821 is an apocalyptic number.
It is an amenable number.
196630575821 is a deficient number, since it is larger than the sum of its proper divisors (1).
196630575821 is an equidigital number, since it uses as much as digits as its factorization.
196630575821 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2721600, while the sum is 53.
The spelling of 196630575821 in words is "one hundred ninety-six billion, six hundred thirty million, five hundred seventy-five thousand, eight hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •