Search a number
-
+
140333606437 is a prime number
BaseRepresentation
bin1000001010110010001…
…0001110011000100101
3111102020002102211202011
42002230202032120211
54244400400401222
6144245100114221
713065411654553
oct2025442163045
9442202384664
10140333606437
1154573731642
1223245535971
1310305a2845b
146b13a6cbd3
1539b516cc77
hex20ac88e625

140333606437 has 2 divisors, whose sum is σ = 140333606438. Its totient is φ = 140333606436.

The previous prime is 140333606423. The next prime is 140333606443. The reversal of 140333606437 is 734606333041.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 83572449921 + 56761156516 = 289089^2 + 238246^2 .

It is a cyclic number.

It is not a de Polignac number, because 140333606437 - 223 = 140325217829 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 140333606437.

It is a congruent number.

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

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

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

Almost surely, 2140333606437 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 140333606437 its reverse (734606333041), we get a palindrome (874939939478).

The spelling of 140333606437 in words is "one hundred forty billion, three hundred thirty-three million, six hundred six thousand, four hundred thirty-seven".