Search a number
-
+
204354445354219 is a prime number
BaseRepresentation
bin101110011101101111111010…
…000111111010010011101011
3222210120002112122210100110101
4232131233322013322103223
5203241120401002313334
62002343045225330231
761021056442162366
oct5635577207722353
9883502478710411
10204354445354219
115a128262990726
121ab05316336977
138a04706908834
143866b44d590dd
151895adc495214
hexb9dbfa1fa4eb

204354445354219 has 2 divisors, whose sum is σ = 204354445354220. Its totient is φ = 204354445354218.

The previous prime is 204354445354201. The next prime is 204354445354229. The reversal of 204354445354219 is 912453544453402.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 204354445354219 - 25 = 204354445354187 is a prime.

It is a super-2 number, since 2×2043544453542192 (a number of 29 digits) contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 204354445354219.

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

It is a pernicious number, because its binary representation contains a prime number (31) of ones.

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

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

Almost surely, 2204354445354219 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 41472000, while the sum is 55.

The spelling of 204354445354219 in words is "two hundred four trillion, three hundred fifty-four billion, four hundred forty-five million, three hundred fifty-four thousand, two hundred nineteen".