Search a number
-
+
130489111 is a prime number
BaseRepresentation
bin1111100011100…
…01101100010111
3100002112112102001
413301301230113
5231401122421
620540500131
73143065504
oct761615427
9302475361
10130489111
1167726445
123784a647
132105a2bc
141348a4ab
15b6c8691
hex7c71b17

130489111 has 2 divisors, whose sum is σ = 130489112. Its totient is φ = 130489110.

The previous prime is 130489109. The next prime is 130489141. The reversal of 130489111 is 111984031.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 130489111 - 21 = 130489109 is a prime.

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

It is a Chen prime.

It is equal to p7404274 and since 130489111 and 7404274 have the same sum of digits, it is a Honaker prime.

It is a self number, because there is not a number n which added to its sum of digits gives 130489111.

It is a congruent number.

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

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

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

Almost surely, 2130489111 is an apocalyptic number.

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

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

130489111 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 864, while the sum is 28.

The square root of 130489111 is about 11423.1830502711. The cubic root of 130489111 is about 507.2142239917.

The spelling of 130489111 in words is "one hundred thirty million, four hundred eighty-nine thousand, one hundred eleven".