Search a number
-
+
49555010437 is a prime number
BaseRepresentation
bin101110001001101101…
…010111001110000101
311201220120111100200221
4232021231113032011
51302442040313222
634433143504341
73403006432042
oct561155271605
9151816440627
1049555010437
111a01a569889
12972ba580b1
1348998087aa
1425815b81c9
1514507960c7
hexb89b57385

49555010437 has 2 divisors, whose sum is σ = 49555010438. Its totient is φ = 49555010436.

The previous prime is 49555010423. The next prime is 49555010507. The reversal of 49555010437 is 73401055594.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 45864933921 + 3690076516 = 214161^2 + 60746^2 .

It is a cyclic number.

It is not a de Polignac number, because 49555010437 - 227 = 49420792709 is a prime.

It is a super-2 number, since 2×495550104372 (a number of 22 digits) contains 22 as substring.

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

It is a congruent number.

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

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

Almost surely, 249555010437 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 378000, while the sum is 43.

The spelling of 49555010437 in words is "forty-nine billion, five hundred fifty-five million, ten thousand, four hundred thirty-seven".