Search a number
-
+
15117641047 is a prime number
BaseRepresentation
bin11100001010001010…
…01110010101010111
31110000120111201212101
432011011032111113
5221430104003142
610540035302531
71043425554145
oct160505162527
943016451771
1015117641047
116458572523
122b1aa4aa47
13156c028342
14a35ac8595
155d73010b7
hex38514e557

15117641047 has 2 divisors, whose sum is σ = 15117641048. Its totient is φ = 15117641046.

The previous prime is 15117641003. The next prime is 15117641069. The reversal of 15117641047 is 74014671151.

15117641047 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 15117641047 - 211 = 15117638999 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 215117641047 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 23520, while the sum is 37.

The spelling of 15117641047 in words is "fifteen billion, one hundred seventeen million, six hundred forty-one thousand, forty-seven".