Search a number
-
+
103031332011301 is a prime number
BaseRepresentation
bin10111011011010011011001…
…111100011111110100100101
3111111210200212200021220002211
4113123103121330133310211
5102001031131443330201
61003043535052003421
730462524312122141
oct2733233174376445
9444720780256084
10103031332011301
112a913384998771
12b6801b4760571
134564a74ca34b5
141b62a59008221
15bda134a52651
hex5db4d9f1fd25

103031332011301 has 2 divisors, whose sum is σ = 103031332011302. Its totient is φ = 103031332011300.

The previous prime is 103031332011287. The next prime is 103031332011331. The reversal of 103031332011301 is 103110233130301.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 100764937254276 + 2266394757025 = 10038174^2 + 1505455^2 .

It is a cyclic number.

It is not a de Polignac number, because 103031332011301 - 27 = 103031332011173 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2103031332011301 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 486, while the sum is 22.

Adding to 103031332011301 its reverse (103110233130301), we get a palindrome (206141565141602).

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