Search a number
-
+
465143241061 is a prime number
BaseRepresentation
bin1101100010011001011…
…00101001100101100101
31122110121122001220002201
412301030230221211211
530110103132203221
6553403413534501
745414453212422
oct6611454514545
91573548056081
10465143241061
1116a2a2262604
1276193644431
1334b2a7ca725
1418727b62d49
15c175949891
hex6c4cb29965

465143241061 has 2 divisors, whose sum is σ = 465143241062. Its totient is φ = 465143241060.

The previous prime is 465143241019. The next prime is 465143241089. The reversal of 465143241061 is 160142341564.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 261114868036 + 204028373025 = 510994^2 + 451695^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-465143241061 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2465143241061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 69120, while the sum is 37.

The spelling of 465143241061 in words is "four hundred sixty-five billion, one hundred forty-three million, two hundred forty-one thousand, sixty-one".