Search a number
-
+
10031301021311 is a prime number
BaseRepresentation
bin1001000111111001100000…
…1000100100111001111111
31022111222112121121212220222
42101332120020210321333
52303323101030140221
633200152134331555
72053510663546223
oct221763010447177
938458477555828
1010031301021311
113218283a02679
1211601724b9bbb
13579c41c253cb
14269736282783
15125e0cdae9ab
hex91f98224e7f

10031301021311 has 2 divisors, whose sum is σ = 10031301021312. Its totient is φ = 10031301021310.

The previous prime is 10031301021299. The next prime is 10031301021317. The reversal of 10031301021311 is 11312010313001.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10031301021311 - 230 = 10030227279487 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 10031301021311.

It is a congruent number.

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

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

Almost surely, 210031301021311 is an apocalyptic number.

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

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

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

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

Adding to 10031301021311 its reverse (11312010313001), we get a palindrome (21343311334312).

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