Search a number
-
+
15245106047 is a prime number
BaseRepresentation
bin11100011001010110…
…11101101101111111
31110100110100121222022
432030223131231333
5222210221343142
611000431310355
71046534156213
oct161453355577
943313317868
1015245106047
1165135128a6
122b5567b3bb
13158c567012
14a489c8943
155e35cd6d2
hex38caddb7f

15245106047 has 2 divisors, whose sum is σ = 15245106048. Its totient is φ = 15245106046.

The previous prime is 15245106043. The next prime is 15245106049. The reversal of 15245106047 is 74060154251.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 15245106047 - 22 = 15245106043 is a prime.

Together with 15245106049, it forms a pair of twin primes.

It is a Chen prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (15245106043) 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, 7622553023 + 7622553024.

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

Almost surely, 215245106047 is an apocalyptic number.

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

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

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

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

The spelling of 15245106047 in words is "fifteen billion, two hundred forty-five million, one hundred six thousand, forty-seven".