Search a number
-
+
15013656091501 is a prime number
BaseRepresentation
bin1101101001111010001110…
…1000110101101101101101
31222011021212111200201001021
43122132203220311231231
53431440431424412001
651533102311014141
73106462252101334
oct332364350655555
958137774621037
1015013656091501
11486928a505211
1218258b706a351
1384ba214c8cb2
1439c944428d1b
151b08164b3ba1
hexda7a3a35b6d

15013656091501 has 2 divisors, whose sum is σ = 15013656091502. Its totient is φ = 15013656091500.

The previous prime is 15013656091459. The next prime is 15013656091507. The reversal of 15013656091501 is 10519065631051.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 14744632335876 + 269023755625 = 3839874^2 + 518675^2 .

It is an emirp because it is prime and its reverse (10519065631051) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 15013656091501 - 227 = 15013521873773 is a prime.

It is a congruent number.

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

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

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

Almost surely, 215013656091501 is an apocalyptic number.

It is an amenable number.

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

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

15013656091501 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 121500, while the sum is 43.

The spelling of 15013656091501 in words is "fifteen trillion, thirteen billion, six hundred fifty-six million, ninety-one thousand, five hundred one".