Search a number
-
+
143389751047 is a prime number
BaseRepresentation
bin1000010110001010110…
…0011111011100000111
3111201010002010002000021
42011202230133130013
54322130234013142
6145512232000011
713234221526264
oct2054254373407
9451102102007
10143389751047
11558a185a294
1223958b30007
13106a1c39b4a
146d238cc26b
153ae3602267
hex2162b1f707

143389751047 has 2 divisors, whose sum is σ = 143389751048. Its totient is φ = 143389751046.

The previous prime is 143389751033. The next prime is 143389751119. The reversal of 143389751047 is 740157983341.

It is a happy number.

143389751047 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-143389751047 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 143389750985 and 143389751003.

It is a congruent number.

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

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

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

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

Almost surely, 2143389751047 is an apocalyptic number.

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

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

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

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

The spelling of 143389751047 in words is "one hundred forty-three billion, three hundred eighty-nine million, seven hundred fifty-one thousand, forty-seven".