Search a number
-
+
990110010110147 is a prime number
BaseRepresentation
bin1110000100011111111111001…
…1011100001111000011000011
311210211200120222222100122220122
43201013333303130033003003
52014233430300042011042
613425442132004530455
7415360042024204253
oct34107776334170303
94724616888318818
10990110010110147
1126753032a657623
1293069b530b0a2b
1333660c86528aa4
141366d81a03d963
1579700782eb7d2
hex3847ff370f0c3

990110010110147 has 2 divisors, whose sum is σ = 990110010110148. Its totient is φ = 990110010110146.

The previous prime is 990110010110093. The next prime is 990110010110159. The reversal of 990110010110147 is 741011010011099.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 990110010110147 - 210 = 990110010109123 is a prime.

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

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

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

Almost surely, 2990110010110147 is an apocalyptic number.

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

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

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

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

The spelling of 990110010110147 in words is "nine hundred ninety trillion, one hundred ten billion, ten million, one hundred ten thousand, one hundred forty-seven".