Search a number
-
+
10151511110201 is a prime number
BaseRepresentation
bin1001001110111001010100…
…1101101011001000111001
31022221110211021010010012102
42103232111031223020321
52312310243321011301
633331312333553145
72065264623465536
oct223562515531071
938843737103172
1010151511110201
11326426041067a
12117b5206457b5
1358838b7b9c16
1427149b475d8d
151290e6513b6b
hex93b9536b239

10151511110201 has 2 divisors, whose sum is σ = 10151511110202. Its totient is φ = 10151511110200.

The previous prime is 10151511110149. The next prime is 10151511110287. The reversal of 10151511110201 is 10201111515101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 6428633475625 + 3722877634576 = 2535475^2 + 1929476^2 .

It is a cyclic number.

It is not a de Polignac number, because 10151511110201 - 242 = 5753464599097 is a prime.

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

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

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

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

Almost surely, 210151511110201 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 50, while the sum is 20.

Adding to 10151511110201 its reverse (10201111515101), we get a palindrome (20352622625302).

The spelling of 10151511110201 in words is "ten trillion, one hundred fifty-one billion, five hundred eleven million, one hundred ten thousand, two hundred one".