Search a number
-
+
101415120007 is a prime number
BaseRepresentation
bin101111001110011001…
…1111110110010000111
3100200202210102212221211
41132130303332302013
53130144232320012
6114331153552251
710220106203545
oct1363463766207
9320683385854
10101415120007
113a012211773
12177a3875687
139742a53366
144ca0d8ad95
1529885b96a7
hex179ccfec87

101415120007 has 2 divisors, whose sum is σ = 101415120008. Its totient is φ = 101415120006.

The previous prime is 101415119977. The next prime is 101415120013. The reversal of 101415120007 is 700021514101.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 101415120007 - 227 = 101280902279 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2101415120007 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 280, while the sum is 22.

Adding to 101415120007 its reverse (700021514101), we get a palindrome (801436634108).

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