Search a number
-
+
142111495708513 is a prime number
BaseRepresentation
bin100000010011111111101001…
…001110000101111101100001
3200122011201121110221020021221
4200103333221032011331201
5122111323320400133023
61222125041520015041
741635134225466612
oct4023775116057541
9618151543836257
10142111495708513
1141310168541081
1213b321b0461481
13613b0972c0796
142714339867c09
1511669a5a5e85d
hex813fe9385f61

142111495708513 has 2 divisors, whose sum is σ = 142111495708514. Its totient is φ = 142111495708512.

The previous prime is 142111495708453. The next prime is 142111495708529. The reversal of 142111495708513 is 315807594111241.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 114281829911824 + 27829665796689 = 10690268^2 + 5275383^2 .

It is an emirp because it is prime and its reverse (315807594111241) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 142111495708513 - 233 = 142102905773921 is a prime.

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

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

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

Almost surely, 2142111495708513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1209600, while the sum is 52.

The spelling of 142111495708513 in words is "one hundred forty-two trillion, one hundred eleven billion, four hundred ninety-five million, seven hundred eight thousand, five hundred thirteen".