Search a number
-
+
1357586029 is a prime number
BaseRepresentation
bin101000011101011…
…0001111001101101
310111121112111221001
41100322301321231
510240020223104
6342413440301
745433201522
oct12072617155
93447474831
101357586029
1163735a528
1231a7a0091
1318834b257
14cc431149
157e2b7aa4
hex50eb1e6d

1357586029 has 2 divisors, whose sum is σ = 1357586030. Its totient is φ = 1357586028.

The previous prime is 1357586003. The next prime is 1357586033. The reversal of 1357586029 is 9206857531.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 873498025 + 484088004 = 29555^2 + 22002^2 .

It is a cyclic number.

It is not a de Polignac number, because 1357586029 - 229 = 820715117 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 1357586029.

It is a congruent number.

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

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

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

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

Almost surely, 21357586029 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 453600, while the sum is 46.

The square root of 1357586029 is about 36845.4343033163. The cubic root of 1357586029 is about 1107.2757447722.

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