Search a number
-
+
238731599441 is a prime number
BaseRepresentation
bin1101111001010110000…
…0110001111001010001
3211211012121121210112102
43132111200301321101
512402410242140231
6301401034410145
723150664053666
oct3362540617121
9754177553472
10238731599441
1192277845115
123a326890955
131968767b75a
14b7aa035a6d
15632390dacb
hex3795831e51

238731599441 has 2 divisors, whose sum is σ = 238731599442. Its totient is φ = 238731599440.

The previous prime is 238731599377. The next prime is 238731599443. The reversal of 238731599441 is 144995137832.

It is a happy number.

238731599441 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 210860966416 + 27870633025 = 459196^2 + 166945^2 .

It is a cyclic number.

It is not a de Polignac number, because 238731599441 - 26 = 238731599377 is a prime.

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

It is a Chen prime.

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

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

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

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

Almost surely, 2238731599441 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 6531840, while the sum is 56.

The spelling of 238731599441 in words is "two hundred thirty-eight billion, seven hundred thirty-one million, five hundred ninety-nine thousand, four hundred forty-one".