Search a number
-
+
105245322971 is a prime number
BaseRepresentation
bin110001000000100011…
…1000010111011011011
3101001122201122100122212
41202001013002323123
53211020300313341
6120203220305335
710414035325205
oct1420107027333
9331581570585
10105245322971
11406a8271968
121849254224b
139c03433c49
145145941775
152b0e99e5eb
hex18811c2edb

105245322971 has 2 divisors, whose sum is σ = 105245322972. Its totient is φ = 105245322970.

The previous prime is 105245322929. The next prime is 105245323009. The reversal of 105245322971 is 179223542501.

It is a happy number.

It is a strong prime.

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

It is a cyclic number.

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

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

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

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

Almost surely, 2105245322971 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 151200, while the sum is 41.

The spelling of 105245322971 in words is "one hundred five billion, two hundred forty-five million, three hundred twenty-two thousand, nine hundred seventy-one".