Search a number
-
+
465150199981 is a prime number
BaseRepresentation
bin1101100010011010001…
…11001100100010101101
31122110122010011102221111
412301031013030202231
530110111422344411
6553404223032021
745414566315005
oct6611507144255
91573563142844
10465150199981
1116a2a6185985
1276195a3b611
1334b2c09602c
1418728a55005
15c176371721
hex6c4d1cc8ad

465150199981 has 2 divisors, whose sum is σ = 465150199982. Its totient is φ = 465150199980.

The previous prime is 465150199937. The next prime is 465150200023. The reversal of 465150199981 is 189991051564.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 332045622756 + 133104577225 = 576234^2 + 364835^2 .

It is a cyclic number.

It is not a de Polignac number, because 465150199981 - 29 = 465150199469 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2465150199981 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3499200, while the sum is 58.

The spelling of 465150199981 in words is "four hundred sixty-five billion, one hundred fifty million, one hundred ninety-nine thousand, nine hundred eighty-one".