Search a number
-
+
101415120047 is a prime number
BaseRepresentation
bin101111001110011001…
…1111110110010101111
3100200202210102220000022
41132130303332302233
53130144232320142
6114331153552355
710220106203633
oct1363463766257
9320683386008
10101415120047
113a0122117aa
12177a38756bb
139742a53397
144ca0d8adc3
1529885b96d2
hex179ccfecaf

101415120047 has 2 divisors, whose sum is σ = 101415120048. Its totient is φ = 101415120046.

The previous prime is 101415120013. The next prime is 101415120071. The reversal of 101415120047 is 740021514101.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 101415120047 - 28 = 101415119791 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2101415120047 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1120, while the sum is 26.

Adding to 101415120047 its reverse (740021514101), we get a palindrome (841436634148).

The spelling of 101415120047 in words is "one hundred one billion, four hundred fifteen million, one hundred twenty thousand, forty-seven".