Search a number
-
+
15126276501389 is a prime number
BaseRepresentation
bin1101110000011101110001…
…0101100110111110001101
31222120001120012212022000102
43130013130111212332031
53440312103241021024
652100525425140445
73120560142556634
oct334073425467615
958501505768012
1015126276501389
114902021820029
1218436a748a725
1385952b8639a1
143a418964451b
151b370866e1ae
hexdc1dc566f8d

15126276501389 has 2 divisors, whose sum is σ = 15126276501390. Its totient is φ = 15126276501388.

The previous prime is 15126276501331. The next prime is 15126276501433. The reversal of 15126276501389 is 98310567262151.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9031016677225 + 6095259824164 = 3005165^2 + 2468858^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×151262765013892 (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 (15126273501389) by changing a digit.

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

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

Almost surely, 215126276501389 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5443200, while the sum is 56.

The spelling of 15126276501389 in words is "fifteen trillion, one hundred twenty-six billion, two hundred seventy-six million, five hundred one thousand, three hundred eighty-nine".