Search a number
-
+
96651443021141 is a prime number
BaseRepresentation
bin10101111110011101101010…
…111011011010010101010101
3110200012210021020121010100002
4111332131222323122111111
5100132014123403134031
6541321020541301045
726233556600352461
oct2576355273322525
9420183236533302
1096651443021141
1128883712984308
12aa0b844864785
1341c12659a9bb8
1419c1d51d974a1
15b291d4a68ccb
hex57e76aeda555

96651443021141 has 2 divisors, whose sum is σ = 96651443021142. Its totient is φ = 96651443021140.

The previous prime is 96651443021083. The next prime is 96651443021149. The reversal of 96651443021141 is 14112034415669.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 93732313587025 + 2919129434116 = 9681545^2 + 1708546^2 .

It is an emirp because it is prime and its reverse (14112034415669) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 96651443021141 - 214 = 96651443004757 is a prime.

It is a congruent number.

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

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

Almost surely, 296651443021141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 622080, while the sum is 47.

The spelling of 96651443021141 in words is "ninety-six trillion, six hundred fifty-one billion, four hundred forty-three million, twenty-one thousand, one hundred forty-one".