Search a number
-
+
3011430324121 is a prime number
BaseRepresentation
bin101011110100100111001…
…111000001011110011001
3101122220000202102220101221
4223310213033001132121
5343314402130332441
610223233151012041
7430366023260152
oct53644717013631
911586022386357
103011430324121
11a6115aa0143a
12407775b0a021
1318ac909554bb
14a5a7adc2929
1553502e868d1
hex2bd273c1799

3011430324121 has 2 divisors, whose sum is σ = 3011430324122. Its totient is φ = 3011430324120.

The previous prime is 3011430324113. The next prime is 3011430324163. The reversal of 3011430324121 is 1214230341103.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 2067812364121 + 943617960000 = 1437989^2 + 971400^2 .

It is a cyclic number.

It is not a de Polignac number, because 3011430324121 - 23 = 3011430324113 is a prime.

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

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

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

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

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

Almost surely, 23011430324121 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1728, while the sum is 25.

Adding to 3011430324121 its reverse (1214230341103), we get a palindrome (4225660665224).

The spelling of 3011430324121 in words is "three trillion, eleven billion, four hundred thirty million, three hundred twenty-four thousand, one hundred twenty-one".