Search a number
-
+
301110011011009 is a prime number
BaseRepresentation
bin100010001110110111010001…
…1001111101001111111000001
31110111010211120101111101222101
41010131232203033221333001
5303431341300304323014
62544224010204310401
7120265323526416454
oct10435564317517701
91414124511441871
10301110011011009
1187a41047326232
1229931179542401
13cc02724254335
14544db336cb49b
1524c2868145474
hex111dba33e9fc1

301110011011009 has 2 divisors, whose sum is σ = 301110011011010. Its totient is φ = 301110011011008.

The previous prime is 301110011010989. The next prime is 301110011011013. The reversal of 301110011011009 is 900110110011103.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 172522235491984 + 128587775519025 = 13134772^2 + 11339655^2 .

It is a cyclic number.

It is not a de Polignac number, because 301110011011009 - 227 = 301109876793281 is a prime.

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

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

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

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

Almost surely, 2301110011011009 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27, while the sum is 19.

The spelling of 301110011011009 in words is "three hundred one trillion, one hundred ten billion, eleven million, eleven thousand, nine".