Search a number
-
+
142364651521 is a prime number
BaseRepresentation
bin1000010010010110011…
…0000011000000000001
3111121110122012121211011
42010211212003000001
54313030322322041
6145222412320521
713166633400031
oct2044546030001
9447418177734
10142364651521
11554161528a4
1223711773141
131056a752391
146c676c98c1
153a83613e81
hex2125983001

142364651521 has 2 divisors, whose sum is σ = 142364651522. Its totient is φ = 142364651520.

The previous prime is 142364651519. The next prime is 142364651531. The reversal of 142364651521 is 125156463241.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 142359063025 + 5588496 = 377305^2 + 2364^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 142364651521 - 21 = 142364651519 is a prime.

It is a super-2 number, since 2×1423646515212 (a number of 23 digits) contains 22 as substring.

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

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

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

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

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

Almost surely, 2142364651521 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 172800, while the sum is 40.

The spelling of 142364651521 in words is "one hundred forty-two billion, three hundred sixty-four million, six hundred fifty-one thousand, five hundred twenty-one".