Search a number
-
+
204496132031 is a prime number
BaseRepresentation
bin1011111001110011101…
…0110101011110111111
3201112211200112212010222
42332130322311132333
511322302002211111
6233535541451555
720526414304442
oct2763472653677
9645750485128
10204496132031
11797a980a7a4
1233771410bbb
131638c970229
149c7d2a1659
1554bd04b7db
hex2f9ceb57bf

204496132031 has 2 divisors, whose sum is σ = 204496132032. Its totient is φ = 204496132030.

The previous prime is 204496132013. The next prime is 204496132033. The reversal of 204496132031 is 130231694402.

Together with previous prime (204496132013) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 204496132031 - 214 = 204496115647 is a prime.

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

Together with 204496132033, it forms a pair of twin primes.

It is a Chen prime.

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

It is a congruent number.

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

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

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

Almost surely, 2204496132031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 31104, while the sum is 35.

The spelling of 204496132031 in words is "two hundred four billion, four hundred ninety-six million, one hundred thirty-two thousand, thirty-one".