Search a number
-
+
140550815063537 is a prime number
BaseRepresentation
bin11111111101010010001001…
…011001111001110111110001
3200102122112012221221221102222
4133331102021121321313301
5121410241032124013122
61214532053021250425
741414314136053634
oct3775221131716761
9612575187857388
10140550815063537
11408692a1a5101a
121391b833703a15
136056b674265b8
14269c9a51abc1b
15113b0b1314b42
hex7fd489679df1

140550815063537 has 2 divisors, whose sum is σ = 140550815063538. Its totient is φ = 140550815063536.

The previous prime is 140550815063471. The next prime is 140550815063539. The reversal of 140550815063537 is 735360518055041.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 140422476300001 + 128338763536 = 11849999^2 + 358244^2 .

It is a cyclic number.

It is not a de Polignac number, because 140550815063537 - 216 = 140550814998001 is a prime.

Together with 140550815063539, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

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

Almost surely, 2140550815063537 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7560000, while the sum is 53.

The spelling of 140550815063537 in words is "one hundred forty trillion, five hundred fifty billion, eight hundred fifteen million, sixty-three thousand, five hundred thirty-seven".