Search a number
-
+
10157061515047 is a prime number
BaseRepresentation
bin1001001111001110000000…
…0010110010011100100111
31022222000011002011220021021
42103303200002302130213
52312403130221440142
633334031210232011
72065552311242056
oct223634002623447
938860132156237
1010157061515047
113266649481a17
12118060b425607
13588a6469b345
1427186669039d
1512931d93d267
hex93ce00b2727

10157061515047 has 2 divisors, whose sum is σ = 10157061515048. Its totient is φ = 10157061515046.

The previous prime is 10157061514979. The next prime is 10157061515077. The reversal of 10157061515047 is 74051516075101.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10157061515047 - 231 = 10154914031399 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 10157061514994 and 10157061515012.

It is a congruent number.

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

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

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

Almost surely, 210157061515047 is an apocalyptic number.

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

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

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

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

The spelling of 10157061515047 in words is "ten trillion, one hundred fifty-seven billion, sixty-one million, five hundred fifteen thousand, forty-seven".