Search a number
-
+
130320133141181 is a prime number
BaseRepresentation
bin11101101000011010000101…
…001111100011001010111101
3122002102111001010222212010112
4131220122011033203022331
5114040131113041004211
61141100124230115405
736310214246413544
oct3550320517431275
9562374033885115
10130320133141181
11385845047a0485
1212748ab8aabb65
13579419c536b89
14242775716315b
15100edd452288b
hex7686853e32bd

130320133141181 has 2 divisors, whose sum is σ = 130320133141182. Its totient is φ = 130320133141180.

The previous prime is 130320133141103. The next prime is 130320133141217. The reversal of 130320133141181 is 181141331023031.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 66487879080100 + 63832254061081 = 8154010^2 + 7989509^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

Almost surely, 2130320133141181 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5184, while the sum is 32.

The spelling of 130320133141181 in words is "one hundred thirty trillion, three hundred twenty billion, one hundred thirty-three million, one hundred forty-one thousand, one hundred eighty-one".