Search a number
-
+
202567454189 is a prime number
BaseRepresentation
bin1011110010100111110…
…1100000110111101101
3201100212021101212112022
42330221331200313231
511304324232013224
6233020323315525
720430544644122
oct2745175406755
9640767355468
10202567454189
11789aa057571
123331351bba5
1316143208439
149b39090749
155408a7665e
hex2f29f60ded

202567454189 has 2 divisors, whose sum is σ = 202567454190. Its totient is φ = 202567454188.

The previous prime is 202567454143. The next prime is 202567454197. The reversal of 202567454189 is 981454765202.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 129798075625 + 72769378564 = 360275^2 + 269758^2 .

It is a cyclic number.

It is not a de Polignac number, because 202567454189 - 212 = 202567450093 is a prime.

It is a super-2 number, since 2×2025674541892 (a number of 23 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 202567454189.

It is a congruent number.

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

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

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

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

Almost surely, 2202567454189 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4838400, while the sum is 53.

The spelling of 202567454189 in words is "two hundred two billion, five hundred sixty-seven million, four hundred fifty-four thousand, one hundred eighty-nine".