Search a number
-
+
130051111 is a prime number
BaseRepresentation
bin1111100000001…
…10110000100111
3100001201021120211
413300012300213
5231243113421
620523240251
73136262521
oct760066047
9301637524
10130051111
1167457363
1237679087
1320c35b28
14133b4a11
15b63d9e1
hex7c06c27

130051111 has 2 divisors, whose sum is σ = 130051112. Its totient is φ = 130051110.

The previous prime is 130051099. The next prime is 130051157. The reversal of 130051111 is 111150031.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 130051111 - 25 = 130051079 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (130051211) 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, 65025555 + 65025556.

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

Almost surely, 2130051111 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 15, while the sum is 13.

The square root of 130051111 is about 11403.9953963512. The cubic root of 130051111 is about 506.6460824297.

The spelling of 130051111 in words is "one hundred thirty million, fifty-one thousand, one hundred eleven".