Search a number
-
+
13021000273031 is a prime number
BaseRepresentation
bin1011110101111011000000…
…0110001000110010000111
31201002210110220012221011112
42331132300012020302013
53201314002032214111
643405433121155235
72512510345104242
oct275366006106207
951083426187145
1013021000273031
1141701a2219743
12156368278bb1b
13735b4b66758a
143303110ca259
15178a8d139e8b
hexbd7b0188c87

13021000273031 has 2 divisors, whose sum is σ = 13021000273032. Its totient is φ = 13021000273030.

The previous prime is 13021000273013. The next prime is 13021000273069. The reversal of 13021000273031 is 13037200012031.

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

It is a weak prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-13021000273031 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 213021000273031 is an apocalyptic number.

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

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

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

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

Adding to 13021000273031 its reverse (13037200012031), we get a palindrome (26058200285062).

The spelling of 13021000273031 in words is "thirteen trillion, twenty-one billion, two hundred seventy-three thousand, thirty-one".