Search a number
-
+
137009068051 is a prime number
BaseRepresentation
bin111111110011001100…
…0000111100000010011
3111002122101201210102211
41333212120013200103
54221043310134201
6142535135452551
712620132602042
oct1774630074023
9432571653384
10137009068051
1153118057759
1222678087157
13cbc603408b
1468ba306559
15386d36e651
hex1fe6607813

137009068051 has 2 divisors, whose sum is σ = 137009068052. Its totient is φ = 137009068050.

The previous prime is 137009068003. The next prime is 137009068057. The reversal of 137009068051 is 150860900731.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 137009068051 - 29 = 137009067539 is a prime.

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

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

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

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

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

Almost surely, 2137009068051 is an apocalyptic number.

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

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

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

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

Adding to 137009068051 its reverse (150860900731), we get a palindrome (287869968782).

The spelling of 137009068051 in words is "one hundred thirty-seven billion, nine million, sixty-eight thousand, fifty-one".