Search a number
-
+
10115700190157 is a prime number
BaseRepresentation
bin1001001100110011111010…
…1101110110101111001101
31022211001101112112220002102
42103030332231312233031
52311213423222041112
633303031041404445
72062556323625042
oct223147655665715
938731345486072
1010115700190157
113250054050391
1211745a7639725
13584ba258bac3
1426d86139b1c9
151281ec6a0bc2
hex9333eb76bcd

10115700190157 has 2 divisors, whose sum is σ = 10115700190158. Its totient is φ = 10115700190156.

The previous prime is 10115700190111. The next prime is 10115700190247. The reversal of 10115700190157 is 75109100751101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 5435374669321 + 4680325520836 = 2331389^2 + 2163406^2 .

It is a cyclic number.

It is not a de Polignac number, because 10115700190157 - 212 = 10115700186061 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 10115700190157.

It is a congruent number.

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

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

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

Almost surely, 210115700190157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11025, while the sum is 38.

The spelling of 10115700190157 in words is "ten trillion, one hundred fifteen billion, seven hundred million, one hundred ninety thousand, one hundred fifty-seven".