Search a number
-
+
305540431315051 is a prime number
BaseRepresentation
bin100010101111000110010110…
…0110111111000000001101011
31111001211101020222221001000211
41011132030230313320001223
5310021433300404040201
63001455200355241551
7121233365501560642
oct10536145467700153
91431741228831024
10305540431315051
1189399a73066939
122a3279482a92b7
1310164453b533ba
145564342da6359
15254cc1b497651
hex115e32cdf806b

305540431315051 has 2 divisors, whose sum is σ = 305540431315052. Its totient is φ = 305540431315050.

The previous prime is 305540431315043. The next prime is 305540431315081. The reversal of 305540431315051 is 150513134045503.

It is a weak prime.

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

It is a cyclic number.

It is not a de Polignac number, because 305540431315051 - 23 = 305540431315043 is a prime.

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

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

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

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

Almost surely, 2305540431315051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 270000, while the sum is 40.

The spelling of 305540431315051 in words is "three hundred five trillion, five hundred forty billion, four hundred thirty-one million, three hundred fifteen thousand, fifty-one".