Search a number
-
+
304872994681 is a prime number
BaseRepresentation
bin1000110111110111101…
…10001011011101111001
31002010221010022210202121
410123323312023131321
514443334441312211
6352020130201241
731012015461043
oct4337366133571
91063833283677
10304872994681
11108328948332
124b105423221
132299857cb08
1410a823c2a93
157de53c9271
hex46fbd8b779

304872994681 has 2 divisors, whose sum is σ = 304872994682. Its totient is φ = 304872994680.

The previous prime is 304872994663. The next prime is 304872994697. The reversal of 304872994681 is 186499278403.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 304575949456 + 297045225 = 551884^2 + 17235^2 .

It is a cyclic number.

It is not a de Polignac number, because 304872994681 - 225 = 304839440249 is a prime.

It is a super-2 number, since 2×3048729946812 (a number of 24 digits) contains 22 as substring.

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

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

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

Almost surely, 2304872994681 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 20901888, while the sum is 61.

The spelling of 304872994681 in words is "three hundred four billion, eight hundred seventy-two million, nine hundred ninety-four thousand, six hundred eighty-one".