Search a number
-
+
507674137153 is a prime number
BaseRepresentation
bin1110110001100111011…
…11001001001001000001
31210112101200110021100111
413120303233021021001
531304204034342103
61025120002351321
751451431652141
oct7306357111101
91715350407314
10507674137153
111863378a7307
128248305b541
1338b48009231
141a800504921
15d31471186d
hex7633bc9241

507674137153 has 2 divisors, whose sum is σ = 507674137154. Its totient is φ = 507674137152.

The previous prime is 507674137121. The next prime is 507674137193. The reversal of 507674137153 is 351731476705.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 476827537729 + 30846599424 = 690527^2 + 175632^2 .

It is a cyclic number.

It is not a de Polignac number, because 507674137153 - 25 = 507674137121 is a prime.

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

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

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

Almost surely, 2507674137153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1852200, while the sum is 49.

The spelling of 507674137153 in words is "five hundred seven billion, six hundred seventy-four million, one hundred thirty-seven thousand, one hundred fifty-three".