Search a number
-
+
505146557 is a prime number
BaseRepresentation
bin11110000110111…
…110110010111101
31022012112002210202
4132012332302331
52013304142212
6122043013245
715342450326
oct3606766275
91265462722
10505146557
1123a1620a3
1212120a225
13808677b6
144b13544d
152e5330c2
hex1e1becbd

505146557 has 2 divisors, whose sum is σ = 505146558. Its totient is φ = 505146556.

The previous prime is 505146547. The next prime is 505146571. The reversal of 505146557 is 755641505.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 253892356 + 251254201 = 15934^2 + 15851^2 .

It is a cyclic number.

It is not a de Polignac number, because 505146557 - 24 = 505146541 is a prime.

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 505146557.

It is a congruent number.

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

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

Almost surely, 2505146557 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 105000, while the sum is 38.

The square root of 505146557 is about 22475.4656681458. The cubic root of 505146557 is about 796.4144522552.

The spelling of 505146557 in words is "five hundred five million, one hundred forty-six thousand, five hundred fifty-seven".