Search a number
-
+
16507271402813 is a prime number
BaseRepresentation
bin1111000000110110011000…
…0011000101010100111101
32011110002011010102001102102
43300031212003011110331
54130423342434342223
655035200310434445
73322416400550222
oct360154603052475
964402133361372
1016507271402813
1152947703aa484
121a27277962a25
13929823c364a9
14410d55b49949
151d95d3088928
hexf03660c553d

16507271402813 has 2 divisors, whose sum is σ = 16507271402814. Its totient is φ = 16507271402812.

The previous prime is 16507271402767. The next prime is 16507271402827. The reversal of 16507271402813 is 31820417270561.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 13929891604729 + 2577379798084 = 3732277^2 + 1605422^2 .

It is a cyclic number.

It is not a de Polignac number, because 16507271402813 - 26 = 16507271402749 is a prime.

It is a super-2 number, since 2×165072714028132 (a number of 27 digits) contains 22 as substring.

It is a congruent number.

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

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

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

Almost surely, 216507271402813 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 564480, while the sum is 47.

The spelling of 16507271402813 in words is "sixteen trillion, five hundred seven billion, two hundred seventy-one million, four hundred two thousand, eight hundred thirteen".