Search a number
-
+
505105061557 is a prime number
BaseRepresentation
bin1110101100110101001…
…10111001011010110101
31210021202122021201011111
413112122212321122311
531233423343432212
61024013030235021
751330655116625
oct7263246713265
91707678251144
10505105061557
11185239703838
1281a867b5a71
13388289a2c65
141a639232885
15d213dddea7
hex759a9b96b5

505105061557 has 2 divisors, whose sum is σ = 505105061558. Its totient is φ = 505105061556.

The previous prime is 505105061479. The next prime is 505105061579. The reversal of 505105061557 is 755160501505.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 499303344996 + 5801716561 = 706614^2 + 76169^2 .

It is a cyclic number.

It is not a de Polignac number, because 505105061557 - 219 = 505104537269 is a prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2505105061557 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 131250, while the sum is 40.

The spelling of 505105061557 in words is "five hundred five billion, one hundred five million, sixty-one thousand, five hundred fifty-seven".