Search a number
-
+
141650507 is a prime number
BaseRepresentation
bin10000111000101…
…10101001001011
3100212112120222002
420130112221023
5242230304012
622020021215
73340003145
oct1034265113
9325476862
10141650507
1172a5a139
123b53180b
132346768b
1414b53c95
15c6807c2
hex8716a4b

141650507 has 2 divisors, whose sum is σ = 141650508. Its totient is φ = 141650506.

The previous prime is 141650489. The next prime is 141650549. The reversal of 141650507 is 705056141.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 141650507 - 28 = 141650251 is a prime.

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

It is an alternating number because its digits alternate between odd and even.

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

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

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

Almost surely, 2141650507 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 4200, while the sum is 29.

The square root of 141650507 is about 11901.7018530965. The cubic root of 141650507 is about 521.2819786502.

The spelling of 141650507 in words is "one hundred forty-one million, six hundred fifty thousand, five hundred seven".