Search a number
-
+
5641462069 is a prime number
BaseRepresentation
bin1010100000100000…
…11110000100110101
3112120011101222002121
411100100132010311
543023203241234
62331444035541
7256541431165
oct52020360465
915504358077
105641462069
112435504a51
121115392bb1
136bba13649
143b735c5a5
152304144b4
hex15041e135

5641462069 has 2 divisors, whose sum is σ = 5641462070. Its totient is φ = 5641462068.

The previous prime is 5641462067. The next prime is 5641462081. The reversal of 5641462069 is 9602641465.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 5615553969 + 25908100 = 74937^2 + 5090^2 .

It is a cyclic number.

It is not a de Polignac number, because 5641462069 - 21 = 5641462067 is a prime.

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

Together with 5641462067, it forms a pair of twin primes.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 25641462069 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 311040, while the sum is 43.

The square root of 5641462069 is about 75109.6669477372. Note that the first 3 decimals coincide. The cubic root of 5641462069 is about 1780.1798906060.

The spelling of 5641462069 in words is "five billion, six hundred forty-one million, four hundred sixty-two thousand, sixty-nine".