Search a number
-
+
1069051513 is a prime number
BaseRepresentation
bin111111101110000…
…110111001111001
32202111121102222111
4333232012321321
54142134122023
6254025252321
735330534155
oct7756067171
92674542874
101069051513
114a94a7252
1225a0340a1
1314063607a
14a1da4065
1563cc100d
hex3fb86e79

1069051513 has 2 divisors, whose sum is σ = 1069051514. Its totient is φ = 1069051512.

The previous prime is 1069051481. The next prime is 1069051517. The reversal of 1069051513 is 3151509601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 735331689 + 333719824 = 27117^2 + 18268^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1069051513 - 25 = 1069051481 is a prime.

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

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

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

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

Almost surely, 21069051513 is an apocalyptic number.

It is an amenable number.

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

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

1069051513 is an evil number, because the sum of its binary digits is even.

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

The square root of 1069051513 is about 32696.3532064357. The cubic root of 1069051513 is about 1022.5068139980.

The spelling of 1069051513 in words is "one billion, sixty-nine million, fifty-one thousand, five hundred thirteen".