Search a number
-
+
1346905057 is a prime number
BaseRepresentation
bin101000001001000…
…0010001111100001
310110212102212101111
41100102002033201
510224301430212
6341352503321
745243334621
oct12022021741
93425385344
101346905057
11631324783
123170aab41
1318607b754
14cac50881
157d3a7ea7
hex504823e1

1346905057 has 2 divisors, whose sum is σ = 1346905058. Its totient is φ = 1346905056.

The previous prime is 1346905037. The next prime is 1346905061. The reversal of 1346905057 is 7505096431.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 777796321 + 569108736 = 27889^2 + 23856^2 .

It is a cyclic number.

It is not a de Polignac number, because 1346905057 - 27 = 1346904929 is a prime.

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

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

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

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

Almost surely, 21346905057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 113400, while the sum is 40.

The square root of 1346905057 is about 36700.2051356665. The cubic root of 1346905057 is about 1104.3642205750.

The spelling of 1346905057 in words is "one billion, three hundred forty-six million, nine hundred five thousand, fifty-seven".