Search a number
-
+
306438009047 is a prime number
BaseRepresentation
bin1000111010110010010…
…00001111000011010111
31002021222012011202212122
410131121020033003113
520010041112242142
6352435314010155
731065551046122
oct4353110170327
91067865152778
10306438009047
11108a612a3835
124b48157695b
1322b87886511
1410b901ab3b9
157e879b71d2
hex475920f0d7

306438009047 has 2 divisors, whose sum is σ = 306438009048. Its totient is φ = 306438009046.

The previous prime is 306438009023. The next prime is 306438009049. The reversal of 306438009047 is 740900834603.

It is a happy number.

It is a strong prime.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-306438009047 is a prime.

Together with 306438009049, 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 = 306438008989 and 306438009007.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2306438009047 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 435456, while the sum is 44.

The spelling of 306438009047 in words is "three hundred six billion, four hundred thirty-eight million, nine thousand, forty-seven".