Search a number
-
+
41971260419161 is a prime number
BaseRepresentation
bin10011000101100001100100…
…00100010110110001011001
312111121102011022011212221121
421202300302010112301121
521000124120131403121
6225133155244205241
711561215650122263
oct1142606204266131
9174542138155847
1041971260419161
1112411a03355457
12485a38a239821
131a55b46923ba8
14a515c409ab33
154cbb7ea93141
hex262c32116c59

41971260419161 has 2 divisors, whose sum is σ = 41971260419162. Its totient is φ = 41971260419160.

The previous prime is 41971260419147. The next prime is 41971260419183. The reversal of 41971260419161 is 16191406217914.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 36369873193536 + 5601387225625 = 6030744^2 + 2366725^2 .

It is a cyclic number.

It is not a de Polignac number, because 41971260419161 - 29 = 41971260418649 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 41971260419099 and 41971260419108.

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

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

Almost surely, 241971260419161 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 653184, while the sum is 52.

The spelling of 41971260419161 in words is "forty-one trillion, nine hundred seventy-one billion, two hundred sixty million, four hundred nineteen thousand, one hundred sixty-one".