Search a number
-
+
45050521133 is a prime number
BaseRepresentation
bin101001111101001110…
…000110011000101101
311022021122111121000202
4221331032012120231
51214230413134013
632410153003245
73153252053132
oct517516063055
9138248447022
1045050521133
1118118932352
1288933b3525
13432c51c7c7
142275260589
15128a0bc858
hexa7d38662d

45050521133 has 2 divisors, whose sum is σ = 45050521134. Its totient is φ = 45050521132.

The previous prime is 45050521123. The next prime is 45050521141. The reversal of 45050521133 is 33112505054.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 34093037449 + 10957483684 = 184643^2 + 104678^2 .

It is a cyclic number.

It is not a de Polignac number, because 45050521133 - 220 = 45049472557 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

Almost surely, 245050521133 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 45050521133 in words is "forty-five billion, fifty million, five hundred twenty-one thousand, one hundred thirty-three".