Search a number
-
+
130203201032017 is a prime number
BaseRepresentation
bin11101100110101101001011…
…100010111100111101010001
3122002000022012221121020200121
4131212231023202330331101
5114031222123431011032
61140530305205150241
736265604462034361
oct3546551342747521
9562008187536617
10130203201032017
113853995a657133
121272a3046bb381
135786155b14839
142421c234569a1
15100bd3da71a97
hex766b4b8bcf51

130203201032017 has 2 divisors, whose sum is σ = 130203201032018. Its totient is φ = 130203201032016.

The previous prime is 130203201032011. The next prime is 130203201032111. The reversal of 130203201032017 is 710230102302031.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 78456528589761 + 51746672442256 = 8857569^2 + 7193516^2 .

It is a cyclic number.

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

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

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

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

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

Almost surely, 2130203201032017 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 130203201032017 its reverse (710230102302031), we get a palindrome (840433303334048).

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