Search a number
-
+
1030325132131 is a prime number
BaseRepresentation
bin11101111111001000010…
…10011101101101100011
310122111110010111202021221
432333210022131231203
5113340101213212011
62105154055155511
7134303263056661
oct16774412355543
93574403452257
101030325132131
11367a5a749569
12147825975b97
137620bb1aac9
1437c21b27c31
151bc03bb5971
hexefe429db63

1030325132131 has 2 divisors, whose sum is σ = 1030325132132. Its totient is φ = 1030325132130.

The previous prime is 1030325132113. The next prime is 1030325132143. The reversal of 1030325132131 is 1312315230301.

Together with previous prime (1030325132113) 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 1030325132131 - 213 = 1030325123939 is a prime.

It is a super-3 number, since 3×10303251321313 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

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

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

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

Almost surely, 21030325132131 is an apocalyptic number.

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

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

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

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

The spelling of 1030325132131 in words is "one trillion, thirty billion, three hundred twenty-five million, one hundred thirty-two thousand, one hundred thirty-one".