Search a number
-
+
41111114021969 is a prime number
BaseRepresentation
bin10010101100011111011010…
…10110001111110001010001
312101120011222012222121000112
421112033231112033301101
520342031030142200334
6223234103545531105
711442115505306465
oct1126175526176121
9171504865877015
1041111114021969
1112110142112292
12473b738aa3a95
1319c29b8ab02a4
14a21b07a544a5
154b45db2814ce
hex2563ed58fc51

41111114021969 has 2 divisors, whose sum is σ = 41111114021970. Its totient is φ = 41111114021968.

The previous prime is 41111114021899. The next prime is 41111114022023. The reversal of 41111114021969 is 96912041111114.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 28886196169744 + 12224917852225 = 5374588^2 + 3496415^2 .

It is a cyclic number.

It is not a de Polignac number, because 41111114021969 - 220 = 41111112973393 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (41111114021269) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20555557010984 + 20555557010985.

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

Almost surely, 241111114021969 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 41111114021969 in words is "forty-one trillion, one hundred eleven billion, one hundred fourteen million, twenty-one thousand, nine hundred sixty-nine".