Search a number
-
+
137520767 is a prime number
BaseRepresentation
bin10000011001001…
…10011001111111
3100120202210000202
420030212121333
5240201131032
621351314115
73256623116
oct1014463177
9316683022
10137520767
117069942a
123a07b93b
132264ca47
141439ac7d
15c116d62
hex832667f

137520767 has 2 divisors, whose sum is σ = 137520768. Its totient is φ = 137520766.

The previous prime is 137520763. The next prime is 137520797. The reversal of 137520767 is 767025731.

It is a weak prime.

It is an emirp because it is prime and its reverse (767025731) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 137520767 - 22 = 137520763 is a prime.

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

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 137520767.

It is a congruent number.

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

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

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

Almost surely, 2137520767 is an apocalyptic number.

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

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

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

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

The square root of 137520767 is about 11726.9248739812. The cubic root of 137520767 is about 516.1660411003.

The spelling of 137520767 in words is "one hundred thirty-seven million, five hundred twenty thousand, seven hundred sixty-seven".