Search a number
-
+
1071360533 is a prime number
BaseRepresentation
bin111111110110111…
…010101000010101
32202122221202100202
4333312322220111
54143232014113
6254150550245
735356262045
oct7766725025
92678852322
101071360533
114aa834031
1225a968385
13140c64059
14a2405725
15640ca258
hex3fdbaa15

1071360533 has 2 divisors, whose sum is σ = 1071360534. Its totient is φ = 1071360532.

The previous prime is 1071360509. The next prime is 1071360547. The reversal of 1071360533 is 3350631701.

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., 683979409 + 387381124 = 26153^2 + 19682^2 .

It is a cyclic number.

It is not a de Polignac number, because 1071360533 - 214 = 1071344149 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 1071360496 and 1071360505.

It is a congruent number.

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

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

Almost surely, 21071360533 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5670, while the sum is 29.

The square root of 1071360533 is about 32731.6442147351. The cubic root of 1071360533 is about 1023.2424476809.

The spelling of 1071360533 in words is "one billion, seventy-one million, three hundred sixty thousand, five hundred thirty-three".