Search a number
-
+
505212115157 is a prime number
BaseRepresentation
bin1110101101000001111…
…11010001100011010101
31210022001002201121002122
413112200333101203111
531234133300141112
61024031412545325
751333425060351
oct7264077214325
91708032647078
10505212115157
11185294082792
1281ab6622245
1338844c16199
141a64953c461
15d21d4d8872
hex75a0fd18d5

505212115157 has 2 divisors, whose sum is σ = 505212115158. Its totient is φ = 505212115156.

The previous prime is 505212115153. The next prime is 505212115169. The reversal of 505212115157 is 751511212505.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 495117693316 + 10094421841 = 703646^2 + 100471^2 .

It is a cyclic number.

It is not a de Polignac number, because 505212115157 - 22 = 505212115153 is a prime.

It is a super-3 number, since 3×5052121151573 (a number of 36 digits) contains 333 as substring.

It is a congruent number.

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

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

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

Almost surely, 2505212115157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 17500, while the sum is 35.

The spelling of 505212115157 in words is "five hundred five billion, two hundred twelve million, one hundred fifteen thousand, one hundred fifty-seven".