Search a number
-
+
140201552115013 is a prime number
BaseRepresentation
bin11111111000001100110111…
…101101011111010101000101
3200101102010201020002211121211
4133320030313231133111011
5121334030234320140023
61214103412012211421
741350141106014534
oct3770146755372505
9611363636084554
10140201552115013
1140744165138424
1213884000169b71
13602cc4646ab0c
142689b1159a31b
151131e6dd51a0d
hex7f8337b5f545

140201552115013 has 2 divisors, whose sum is σ = 140201552115014. Its totient is φ = 140201552115012.

The previous prime is 140201552115007. The next prime is 140201552115017. The reversal of 140201552115013 is 310511255102041.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 104290213458564 + 35911338656449 = 10212258^2 + 5992607^2 .

It is a cyclic number.

It is not a de Polignac number, because 140201552115013 - 225 = 140201518560581 is a prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

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

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

Almost surely, 2140201552115013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6000, while the sum is 31.

The spelling of 140201552115013 in words is "one hundred forty trillion, two hundred one billion, five hundred fifty-two million, one hundred fifteen thousand, thirteen".