Search a number
-
+
538937265101 is a prime number
BaseRepresentation
bin1111101011110110010…
…10100000101111001101
31220112002110112201112012
413311323022200233031
532312220414440401
61051330115551005
753636240111564
oct7657312405715
91815073481465
10538937265101
11198620044034
1288548bbb465
133ba8ac99401
141c1285d2bdb
15e0441958bb
hex7d7b2a0bcd

538937265101 has 2 divisors, whose sum is σ = 538937265102. Its totient is φ = 538937265100.

The previous prime is 538937265049. The next prime is 538937265107. The reversal of 538937265101 is 101562739835.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 460565822500 + 78371442601 = 678650^2 + 279949^2 .

It is a cyclic number.

It is not a de Polignac number, because 538937265101 - 210 = 538937264077 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2538937265101 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1360800, while the sum is 50.

The spelling of 538937265101 in words is "five hundred thirty-eight billion, nine hundred thirty-seven million, two hundred sixty-five thousand, one hundred one".