Search a number
-
+
1069051469 is a prime number
BaseRepresentation
bin111111101110000…
…110111001001101
32202111121102220212
4333232012321031
54142134121334
6254025252205
735330534063
oct7756067115
92674542825
101069051469
114a94a7212
1225a034065
13140636045
14a1da4033
1563cc0ece
hex3fb86e4d

1069051469 has 2 divisors, whose sum is σ = 1069051470. Its totient is φ = 1069051468.

The previous prime is 1069051439. The next prime is 1069051481. The reversal of 1069051469 is 9641509601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1060348969 + 8702500 = 32563^2 + 2950^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1069051469 - 224 = 1052274253 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21069051469 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 1069051469 is about 32696.3525335778. The cubic root of 1069051469 is about 1022.5067999699.

The spelling of 1069051469 in words is "one billion, sixty-nine million, fifty-one thousand, four hundred sixty-nine".