Search a number
-
+
4114141069 is a prime number
BaseRepresentation
bin1111010100111000…
…1100111110001101
3101121201111000120011
43311032030332031
531411210003234
61520124153221
7203644423243
oct36516147615
911551430504
104114141069
111821364095
12969998811
135074768cc
142b0586793
151912beb64
hexf538cf8d

4114141069 has 2 divisors, whose sum is σ = 4114141070. Its totient is φ = 4114141068.

The previous prime is 4114141039. The next prime is 4114141127. The reversal of 4114141069 is 9601414114.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 3425760900 + 688380169 = 58530^2 + 26237^2 .

It is a cyclic number.

It is not a de Polignac number, because 4114141069 - 223 = 4105752461 is a prime.

It is a super-2 number, since 2×41141410692 = 33852313471264925522, which contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 4114141069.

It is a congruent number.

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

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

Almost surely, 24114141069 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3456, while the sum is 31.

The square root of 4114141069 is about 64141.5705217763. The cubic root of 4114141069 is about 1602.3586396627.

The spelling of 4114141069 in words is "four billion, one hundred fourteen million, one hundred forty-one thousand, sixty-nine".