Search a number
-
+
130200112169 is a prime number
BaseRepresentation
bin111100101000010001…
…0000000110000101001
3110110001212110222220122
41321100202000300221
54113122212042134
6135451344133025
712256323456521
oct1712042006051
9413055428818
10130200112169
1150243629396
1221297907175
13c37c49abba
146431cba681
1535c06e102e
hex1e50880c29

130200112169 has 2 divisors, whose sum is σ = 130200112170. Its totient is φ = 130200112168.

The previous prime is 130200112153. The next prime is 130200112171. The reversal of 130200112169 is 961211002031.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 117657232144 + 12542880025 = 343012^2 + 111995^2 .

It is a cyclic number.

It is not a de Polignac number, because 130200112169 - 24 = 130200112153 is a prime.

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

Together with 130200112171, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

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

Almost surely, 2130200112169 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 648, while the sum is 26.

The spelling of 130200112169 in words is "one hundred thirty billion, two hundred million, one hundred twelve thousand, one hundred sixty-nine".