Search a number
-
+
155365013 is a prime number
BaseRepresentation
bin10010100001010…
…10111010010101
3101211100100201202
421100222322111
5304233140023
623230002245
73564403136
oct1120527225
9354310652
10155365013
117a777041
1244046385
1326259b7b
14168c3c8d
15d98e128
hex942ae95

155365013 has 2 divisors, whose sum is σ = 155365014. Its totient is φ = 155365012.

The previous prime is 155364983. The next prime is 155365037. The reversal of 155365013 is 310563551.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 80317444 + 75047569 = 8962^2 + 8663^2 .

It is a cyclic number.

It is not a de Polignac number, because 155365013 - 214 = 155348629 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

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

Almost surely, 2155365013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6750, while the sum is 29.

The square root of 155365013 is about 12464.5502526164. The cubic root of 155365013 is about 537.5898683699.

It can be divided in two parts, 1553 and 65013, that added together give a palindrome (66566).

The spelling of 155365013 in words is "one hundred fifty-five million, three hundred sixty-five thousand, thirteen".