Search a number
-
+
13161315164533 is a prime number
BaseRepresentation
bin1011111110000101101110…
…0000111110000101110101
31201121012122200102221211221
42333201123200332011311
53211113333140231113
643554120312230341
72525605442024464
oct277413340760565
951535580387757
1013161315164533
114214756328498
12158690199b3b1
1374615053c4b3
143370224869db
1517c55180c98d
hexbf85b83e175

13161315164533 has 2 divisors, whose sum is σ = 13161315164534. Its totient is φ = 13161315164532.

The previous prime is 13161315164341. The next prime is 13161315164567. The reversal of 13161315164533 is 33546151316131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 13078761232849 + 82553931684 = 3616457^2 + 287322^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-13161315164533 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 213161315164533 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 291600, while the sum is 43.

The spelling of 13161315164533 in words is "thirteen trillion, one hundred sixty-one billion, three hundred fifteen million, one hundred sixty-four thousand, five hundred thirty-three".