Search a number
-
+
198346660126567 is a prime number
BaseRepresentation
bin101101000110010100101110…
…001110000001111101100111
3222000021202101202222020221021
4231012110232032001331213
5201444202424443022232
61541503110414032011
756531034066262411
oct5506245616017547
9860252352866837
10198346660126567
1158221389833537
121a2b4ab31a8607
13868a018692a74
1436da05b20b9b1
1517de6b9cd8397
hexb4652e381f67

198346660126567 has 2 divisors, whose sum is σ = 198346660126568. Its totient is φ = 198346660126566.

The previous prime is 198346660126463. The next prime is 198346660126603. The reversal of 198346660126567 is 765621066643891.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-198346660126567 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 198346660126496 and 198346660126505.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (198346660226567) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 99173330063283 + 99173330063284.

It is an arithmetic number, because the mean of its divisors is an integer number (99173330063284).

It is a 1-persistent number, because it is pandigital, but 2⋅198346660126567 = 396693320253134 is not.

Almost surely, 2198346660126567 is an apocalyptic number.

198346660126567 is a deficient number, since it is larger than the sum of its proper divisors (1).

198346660126567 is an equidigital number, since it uses as much as digits as its factorization.

198346660126567 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 470292480, while the sum is 70.

The spelling of 198346660126567 in words is "one hundred ninety-eight trillion, three hundred forty-six billion, six hundred sixty million, one hundred twenty-six thousand, five hundred sixty-seven".