Search a number
-
+
103706448611 is a prime number
BaseRepresentation
bin110000010010101100…
…0101101001011100011
3100220200110222102220012
41200211120231023203
53144342322323421
6115350405035135
710330641161063
oct1404530551343
9326613872805
10103706448611
113aa8864a877
12181230b5aab
139a196805bc
14503b3dd3a3
152a6e82695b
hex182562d2e3

103706448611 has 2 divisors, whose sum is σ = 103706448612. Its totient is φ = 103706448610.

The previous prime is 103706448589. The next prime is 103706448613. The reversal of 103706448611 is 116844607301.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 103706448611 - 234 = 86526579427 is a prime.

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

It is a Chen prime.

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

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

Almost surely, 2103706448611 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 96768, while the sum is 41.

The spelling of 103706448611 in words is "one hundred three billion, seven hundred six million, four hundred forty-eight thousand, six hundred eleven".