Search a number
-
+
155110013 is a prime number
BaseRepresentation
bin10010011111011…
…00101001111101
3101210212101221022
421033230221331
5304202010023
623220313525
73562261532
oct1117545175
9353771838
10155110013
117a6124a3
1243b428a5
132619aa96
1416858d89
15d93d7c8
hex93eca7d

155110013 has 2 divisors, whose sum is σ = 155110014. Its totient is φ = 155110012.

The previous prime is 155110003. The next prime is 155110051. The reversal of 155110013 is 310011551.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 96786244 + 58323769 = 9838^2 + 7637^2 .

It is a cyclic number.

It is not a de Polignac number, because 155110013 - 214 = 155093629 is a prime.

It is a super-2 number, since 2×1551100132 = 48118232265720338, which contains 22 as substring.

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

It is a congruent number.

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

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

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

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

Almost surely, 2155110013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 75, while the sum is 17.

The square root of 155110013 is about 12454.3170426965. The cubic root of 155110013 is about 537.2955925834.

Adding to 155110013 its reverse (310011551), we get a palindrome (465121564).

The spelling of 155110013 in words is "one hundred fifty-five million, one hundred ten thousand, thirteen".