Search a number
-
+
364655028641 is a prime number
BaseRepresentation
bin1010100111001110010…
…00100010100110100001
31021212020102202210022112
411103213020202212201
521433303141404031
6435304210445105
735226330413201
oct5234710424641
91255212683275
10364655028641
11130716291272
125a80a293795
1328504b022c7
1413913d38401
15974392462b
hex54e72229a1

364655028641 has 2 divisors, whose sum is σ = 364655028642. Its totient is φ = 364655028640.

The previous prime is 364655028637. The next prime is 364655028709. The reversal of 364655028641 is 146820556463.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 363523379041 + 1131649600 = 602929^2 + 33640^2 .

It is a cyclic number.

It is not a de Polignac number, because 364655028641 - 22 = 364655028637 is a prime.

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

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

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

Almost surely, 2364655028641 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 364655028641 in words is "three hundred sixty-four billion, six hundred fifty-five million, twenty-eight thousand, six hundred forty-one".