Search a number
-
+
130914269 is a prime number
BaseRepresentation
bin1111100110110…
…01011111011101
3100010100010121122
413303121133131
5232003224034
620553540325
73146516153
oct763313735
9303303548
10130914269
1167996912
1237a146a5
1321178985
141355b3d3
15b75e62e
hex7cd97dd

130914269 has 2 divisors, whose sum is σ = 130914270. Its totient is φ = 130914268.

The previous prime is 130914257. The next prime is 130914337. The reversal of 130914269 is 962419031.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 107391769 + 23522500 = 10363^2 + 4850^2 .

It is a cyclic number.

It is not a de Polignac number, because 130914269 - 24 = 130914253 is a prime.

It is a super-2 number, since 2×1309142692 = 34277091655608722, which contains 22 as substring.

It is equal to p7427096 and since 130914269 and 7427096 have the same sum of digits, it is a Honaker prime.

It is a congruent number.

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

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

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

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

Almost surely, 2130914269 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11664, while the sum is 35.

The square root of 130914269 is about 11441.7773531912. Note that the first 3 decimals coincide. The cubic root of 130914269 is about 507.7644931577.

The spelling of 130914269 in words is "one hundred thirty million, nine hundred fourteen thousand, two hundred sixty-nine".