Search a number
-
+
1069051481 is a prime number
BaseRepresentation
bin111111101110000…
…110111001011001
32202111121102221022
4333232012321121
54142134121411
6254025252225
735330534111
oct7756067131
92674542838
101069051481
114a94a7223
1225a034075
13140636054
14a1da4041
1563cc0edb
hex3fb86e59

1069051481 has 2 divisors, whose sum is σ = 1069051482. Its totient is φ = 1069051480.

The previous prime is 1069051469. The next prime is 1069051513. The reversal of 1069051481 is 1841509601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 900960256 + 168091225 = 30016^2 + 12965^2 .

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1069051481 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 21069051481 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8640, while the sum is 35.

The square root of 1069051481 is about 32696.3527170845. The cubic root of 1069051481 is about 1022.5068037958.

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