Search a number
-
+
141017033 is a prime number
BaseRepresentation
bin10000110011110…
…11111111001001
3100211100102000002
420121323333021
5242100021113
621554252345
73331424243
oct1031737711
9324312002
10141017033
1172667203
123b2870b5
13232a5241
1414a2b093
15c5a7c58
hex867bfc9

141017033 has 2 divisors, whose sum is σ = 141017034. Its totient is φ = 141017032.

The previous prime is 141017011. The next prime is 141017039. The reversal of 141017033 is 330710141.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 140256649 + 760384 = 11843^2 + 872^2 .

It is a cyclic number.

It is not a de Polignac number, because 141017033 - 26 = 141016969 is a prime.

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

It is a Chen prime.

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

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

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

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

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

Almost surely, 2141017033 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 252, while the sum is 20.

The square root of 141017033 is about 11875.0592840625. The cubic root of 141017033 is about 520.5037438485.

Adding to 141017033 its reverse (330710141), we get a palindrome (471727174).

The spelling of 141017033 in words is "one hundred forty-one million, seventeen thousand, thirty-three".