Search a number
-
+
140376365596097 is a prime number
BaseRepresentation
bin11111111010101111101011…
…011001111111110111000001
3200102000211221021111210110022
4133322233223121333313001
5121344411244043033342
61214320002335543225
741365600126051331
oct3772575331776701
9612024837453408
10140376365596097
1140801311858134
12138b1a6898ab15
136043585709657
1426943766210c1
1511367a105d9d2
hex7fabeb67fdc1

140376365596097 has 2 divisors, whose sum is σ = 140376365596098. Its totient is φ = 140376365596096.

The previous prime is 140376365596081. The next prime is 140376365596111. The reversal of 140376365596097 is 790695563673041.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 118210734370576 + 22165631225521 = 10872476^2 + 4708039^2 .

It is a cyclic number.

It is not a de Polignac number, because 140376365596097 - 24 = 140376365596081 is a prime.

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

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

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

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

Almost surely, 2140376365596097 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 771573600, while the sum is 71.

The spelling of 140376365596097 in words is "one hundred forty trillion, three hundred seventy-six billion, three hundred sixty-five million, five hundred ninety-six thousand, ninety-seven".