Base | Representation |
---|---|
bin | 1011011101001100011… |
… | …1000010001001101101 |
3 | 200211000101211110011111 |
4 | 2313103013002021231 |
5 | 11211034213132332 |
6 | 230225444152021 |
7 | 20135160666016 |
oct | 2672307021155 |
9 | 624011743144 |
10 | 196815364717 |
11 | 76518162614 |
12 | 32189098611 |
13 | 157375cccba |
14 | 975117600d |
15 | 51bdaad947 |
hex | 2dd31c226d |
196815364717 has 2 divisors, whose sum is σ = 196815364718. Its totient is φ = 196815364716.
The previous prime is 196815364703. The next prime is 196815364727. The reversal of 196815364717 is 717463518691.
It is a happy number.
196815364717 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., 180364993636 + 16450371081 = 424694^2 + 128259^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-196815364717 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (196815364727) 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, 98407682358 + 98407682359.
It is an arithmetic number, because the mean of its divisors is an integer number (98407682359).
Almost surely, 2196815364717 is an apocalyptic number.
It is an amenable number.
196815364717 is a deficient number, since it is larger than the sum of its proper divisors (1).
196815364717 is an equidigital number, since it uses as much as digits as its factorization.
196815364717 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 7620480, while the sum is 58.
The spelling of 196815364717 in words is "one hundred ninety-six billion, eight hundred fifteen million, three hundred sixty-four thousand, seven hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •