Search a number
-
+
140213066768771 is a prime number
BaseRepresentation
bin11111111000010111100110…
…000010011010000110000011
3200101110020102200221212002112
4133320113212002122012003
5121334222330043100041
61214112554343205535
741351026334655623
oct3770274602320603
9611406380855075
10140213066768771
11407490339311a7
12138862944468ab
13603105cbab3c9
14268a4c4958883
1511323e4ba0deb
hex7f85e609a183

140213066768771 has 2 divisors, whose sum is σ = 140213066768772. Its totient is φ = 140213066768770.

The previous prime is 140213066768717. The next prime is 140213066768777. The reversal of 140213066768771 is 177867660312041.

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

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 140213066768771 - 26 = 140213066768707 is a prime.

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

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

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

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

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

Almost surely, 2140213066768771 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 14224896, while the sum is 59.

The spelling of 140213066768771 in words is "one hundred forty trillion, two hundred thirteen billion, sixty-six million, seven hundred sixty-eight thousand, seven hundred seventy-one".