Search a number
-
+
202067731 is a prime number
BaseRepresentation
bin11000000101101…
…00111100010011
3112002020002211001
430002310330103
5403212131411
632015002431
75002355515
oct1402647423
9462202731
10202067731
11a4075528
1257809417
1332b2c508
141cb9dbb5
1512b16dc1
hexc0b4f13

202067731 has 2 divisors, whose sum is σ = 202067732. Its totient is φ = 202067730.

The previous prime is 202067713. The next prime is 202067741. The reversal of 202067731 is 137760202.

Together with previous prime (202067713) 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 a de Polignac number, because none of the positive numbers 2k-202067731 is a prime.

It is a super-2 number, since 2×2020677312 = 81662735822976722, which contains 22 as substring.

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

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

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

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

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

Almost surely, 2202067731 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3528, while the sum is 28.

The square root of 202067731 is about 14215.0529721138. The cubic root of 202067731 is about 586.8120025961.

It can be divided in two parts, 2020 and 67731, that added together give a triangular number (69751 = T373).

The spelling of 202067731 in words is "two hundred two million, sixty-seven thousand, seven hundred thirty-one".