Search a number
-
+
1356020957 is a prime number
BaseRepresentation
bin101000011010011…
…0011110011011101
310111111121000001102
41100310303303131
510234120132312
6342320122445
745413662604
oct12064636335
93444530042
101356020957
11636490685
1231a166425
13187c20a85
14cc144a3b
157e0a8ec2
hex50d33cdd

1356020957 has 2 divisors, whose sum is σ = 1356020958. Its totient is φ = 1356020956.

The previous prime is 1356020927. The next prime is 1356020983. The reversal of 1356020957 is 7590206531.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 725709721 + 630311236 = 26939^2 + 25106^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1356020957 - 222 = 1351826653 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21356020957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 56700, while the sum is 38.

The square root of 1356020957 is about 36824.1898349441. The cubic root of 1356020957 is about 1106.8500792661.

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