Search a number
-
+
306931512131 is a prime number
BaseRepresentation
bin1000111011101101000…
…10110011001101000011
31002100020120210022211122
410131312202303031003
520012043431342011
6353000303302455
731114022543456
oct4356642631503
91070216708748
10306931512131
11109194922a22
124b59a8aaa2b
1322c35ba538a
1410bd995149d
157eb5e9a3db
hex47768b3343

306931512131 has 2 divisors, whose sum is σ = 306931512132. Its totient is φ = 306931512130.

The previous prime is 306931512103. The next prime is 306931512143. The reversal of 306931512131 is 131215139603.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 306931512131 - 26 = 306931512067 is a prime.

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

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

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

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

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

Almost surely, 2306931512131 is an apocalyptic number.

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

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

306931512131 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 14580, while the sum is 35.

The spelling of 306931512131 in words is "three hundred six billion, nine hundred thirty-one million, five hundred twelve thousand, one hundred thirty-one".