Search a number
-
+
134645033 is a prime number
BaseRepresentation
bin10000000011010…
…00010100101001
3100101100200021002
420001220110221
5233432120113
621205524345
73223315055
oct1001502451
9311320232
10134645033
116a004896
12391136b5
1321b83b23
1413c4cc65
15bc49c58
hex8068529

134645033 has 2 divisors, whose sum is σ = 134645034. Its totient is φ = 134645032.

The previous prime is 134645023. The next prime is 134645041. The reversal of 134645033 is 330546431.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 102981904 + 31663129 = 10148^2 + 5627^2 .

It is an emirp because it is prime and its reverse (330546431) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 134645033 - 212 = 134640937 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is equal to p7626413 and since 134645033 and 7626413 have the same sum of digits, it is a Honaker prime.

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

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

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

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

Almost surely, 2134645033 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 134645033 is about 11603.6646366568. The cubic root of 134645033 is about 512.5427708108.

The spelling of 134645033 in words is "one hundred thirty-four million, six hundred forty-five thousand, thirty-three".