Search a number
-
+
15321505341133 is a prime number
BaseRepresentation
bin1101111011110101000011…
…1000100001111011001101
32000020201111001100221001201
43132331100320201323031
54002011420331404013
652330334040505501
73140641120410505
oct336752070417315
960221431327051
1015321505341133
1149778a5374982
1218754b117b291
13871a725683c4
143ad7c9bd2a05
151b8832ce13dd
hexdef50e21ecd

15321505341133 has 2 divisors, whose sum is σ = 15321505341134. Its totient is φ = 15321505341132.

The previous prime is 15321505341097. The next prime is 15321505341239. The reversal of 15321505341133 is 33114350512351.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 15198442596324 + 123062744809 = 3898518^2 + 350803^2 .

It is a cyclic number.

It is not a de Polignac number, because 15321505341133 - 237 = 15184066387661 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 215321505341133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 81000, while the sum is 37.

Adding to 15321505341133 its reverse (33114350512351), we get a palindrome (48435855853484).

The spelling of 15321505341133 in words is "fifteen trillion, three hundred twenty-one billion, five hundred five million, three hundred forty-one thousand, one hundred thirty-three".