Search a number
-
+
642370155642431 is a prime number
BaseRepresentation
bin1001001000001110110111010…
…0111100001111111000111111
310010020102222122121210221212222
42102003231310330033320333
51133144043034321024211
610154112435305515555
7252206466201014156
oct22203556474177077
93106388577727788
10642370155642431
11176751720339677
12600677814a2bbb
1321758326c07bb8
14b48ac4a8a859d
154e3e7c667d1db
hex2483b74f0fe3f

642370155642431 has 2 divisors, whose sum is σ = 642370155642432. Its totient is φ = 642370155642430.

The previous prime is 642370155642421. The next prime is 642370155642463. The reversal of 642370155642431 is 134246551073246.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 642370155642431 - 210 = 642370155641407 is a prime.

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

It is a Sophie Germain prime.

It is a congruent number.

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

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

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

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

Almost surely, 2642370155642431 is an apocalyptic number.

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

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

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

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

The spelling of 642370155642431 in words is "six hundred forty-two trillion, three hundred seventy billion, one hundred fifty-five million, six hundred forty-two thousand, four hundred thirty-one".