Search a number
-
+
200091510076727 is a prime number
BaseRepresentation
bin101101011111101101101111…
…011000010111010100110111
3222020110120011100222121112102
4231133231233120113110313
5202211244403034423402
61545320434252012315
760101064102165233
oct5537555730272467
9866416140877472
10200091510076727
1158834373077435
121a5370a9a6109b
138785718bc0b89
14375a6a32c95c3
15181ec8cca6102
hexb5fb6f617537

200091510076727 has 2 divisors, whose sum is σ = 200091510076728. Its totient is φ = 200091510076726.

The previous prime is 200091510076649. The next prime is 200091510076729. The reversal of 200091510076727 is 727670015190002.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 200091510076727 - 210 = 200091510075703 is a prime.

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

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

It is a Chen prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (200091510076729) 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, 100045755038363 + 100045755038364.

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

Almost surely, 2200091510076727 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 370440, while the sum is 47.

The spelling of 200091510076727 in words is "two hundred trillion, ninety-one billion, five hundred ten million, seventy-six thousand, seven hundred twenty-seven".