Search a number
-
+
140200502200337 is a prime number
BaseRepresentation
bin11111111000001011111001…
…001000011000100000010001
3200101102001000001111122110002
4133320023321020120200101
5121334021112030402322
61214103115505015345
741350103066623025
oct3770137110304021
9611361001448402
10140200502200337
1140743776521a47
1213883968624555
13602cb09aa5327
142689a51d78385
151131e0bab0c92
hex7f82f9218811

140200502200337 has 2 divisors, whose sum is σ = 140200502200338. Its totient is φ = 140200502200336.

The previous prime is 140200502200333. The next prime is 140200502200373. The reversal of 140200502200337 is 733002205002041.

Together with next prime (140200502200373) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 97965177925696 + 42235324274641 = 9897736^2 + 6498871^2 .

It is a cyclic number.

It is not a de Polignac number, because 140200502200337 - 22 = 140200502200333 is a prime.

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

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

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

Almost surely, 2140200502200337 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 140200502200337 its reverse (733002205002041), we get a palindrome (873202707202378).

The spelling of 140200502200337 in words is "one hundred forty trillion, two hundred billion, five hundred two million, two hundred thousand, three hundred thirty-seven".