Search a number
-
+
12320301113 is a prime number
BaseRepresentation
bin10110111100101100…
…01110000000111001
31011210121211010212122
423132112032000321
5200212444113423
65354310451025
7614210555141
oct133626160071
934717733778
1012320301113
11525254163a
12247a063a75
13121461cb03
1484c397921
154c193e8c8
hex2de58e039

12320301113 has 2 divisors, whose sum is σ = 12320301114. Its totient is φ = 12320301112.

The previous prime is 12320301073. The next prime is 12320301127. The reversal of 12320301113 is 31110302321.

12320301113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 6886842169 + 5433458944 = 82987^2 + 73712^2 .

It is a cyclic number.

It is not a de Polignac number, because 12320301113 - 220 = 12319252537 is a prime.

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

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

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

Almost surely, 212320301113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 108, while the sum is 17.

Adding to 12320301113 its reverse (31110302321), we get a palindrome (43430603434).

The spelling of 12320301113 in words is "twelve billion, three hundred twenty million, three hundred one thousand, one hundred thirteen".