Search a number
-
+
13032303102131 is a prime number
BaseRepresentation
bin1011110110100101000111…
…0011000000100010110011
31201010212122121111010211112
42331221101303000202303
53202010124043232011
643414542444103535
72513360422421615
oct275512163004263
951125577433745
1013032303102131
114174a72393515
1215658b7b34bab
13736c30240631
14330aa42a8db5
1517900059658b
hexbda51cc08b3

13032303102131 has 2 divisors, whose sum is σ = 13032303102132. Its totient is φ = 13032303102130.

The previous prime is 13032303102113. The next prime is 13032303102139. The reversal of 13032303102131 is 13120130323031.

Together with previous prime (13032303102113) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 13032303102131 - 26 = 13032303102067 is a prime.

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

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

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

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

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

Almost surely, 213032303102131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 972, while the sum is 23.

Adding to 13032303102131 its reverse (13120130323031), we get a palindrome (26152433425162).

The spelling of 13032303102131 in words is "thirteen trillion, thirty-two billion, three hundred three million, one hundred two thousand, one hundred thirty-one".