Search a number
-
+
2311201301029 is a prime number
BaseRepresentation
bin100001101000011110010…
…101010010001000100101
322011221121120222221001021
4201220132111102020211
5300331320013113104
64525430132531141
7325656502626625
oct41503625221045
98157546887037
102311201301029
118111a1977365
12313b14780ab1
13139c39c0bb4a
147dc11502885
15401bdc40754
hex21a1e552225

2311201301029 has 2 divisors, whose sum is σ = 2311201301030. Its totient is φ = 2311201301028.

The previous prime is 2311201300957. The next prime is 2311201301033. The reversal of 2311201301029 is 9201031021132.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2250045000225 + 61156300804 = 1500015^2 + 247298^2 .

It is a cyclic number.

It is not a de Polignac number, because 2311201301029 - 27 = 2311201300901 is a prime.

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

It is a congruent number.

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

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

Almost surely, 22311201301029 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 2311201301029 in words is "two trillion, three hundred eleven billion, two hundred one million, three hundred one thousand, twenty-nine".