Search a number
-
+
643337380501001 is a prime number
BaseRepresentation
bin1001001001000111001010100…
…0000010010001011000001001
310010100212110020012000200121222
42102101302220002101120021
51133310414423402013001
610200133040151211425
7252336410010452054
oct22221625002213011
93110773205020558
10643337380501001
11176a9493a58171a
12601a3117076b75
13217c85baba6114
14b4c19a40b3a9b
154e59a3584161b
hex2491ca8091609

643337380501001 has 2 divisors, whose sum is σ = 643337380501002. Its totient is φ = 643337380501000.

The previous prime is 643337380500929. The next prime is 643337380501003. The reversal of 643337380501001 is 100105083733346.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 579675492755401 + 63661887745600 = 24076451^2 + 7978840^2 .

It is a cyclic number.

It is not a de Polignac number, because 643337380501001 - 234 = 643320200631817 is a prime.

Together with 643337380501003, 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 (643337380501003) by changing a digit.

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

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

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

Almost surely, 2643337380501001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 544320, while the sum is 44.

The spelling of 643337380501001 in words is "six hundred forty-three trillion, three hundred thirty-seven billion, three hundred eighty million, five hundred one thousand, one".