Search a number
-
+
15033000161393 is a prime number
BaseRepresentation
bin1101101011000010010010…
…1000100111000001110001
31222020010210121222021100022
43122300210220213001301
53432300041020131033
651550022005333225
73111045521012504
oct332604450470161
958203717867308
1015033000161393
114876506755235
1218295b5407215
138507b50246b6
1439d85b56913b
151b1099865098
hexdac24a27071

15033000161393 has 2 divisors, whose sum is σ = 15033000161394. Its totient is φ = 15033000161392.

The previous prime is 15033000161339. The next prime is 15033000161401. The reversal of 15033000161393 is 39316100033051.

Together with previous prime (15033000161339) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 13482357579889 + 1550642581504 = 3671833^2 + 1245248^2 .

It is a cyclic number.

It is not a de Polignac number, because 15033000161393 - 240 = 13933488533617 is a prime.

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

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

Almost surely, 215033000161393 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 21870, while the sum is 35.

The spelling of 15033000161393 in words is "fifteen trillion, thirty-three billion, one hundred sixty-one thousand, three hundred ninety-three".