Search a number
-
+
143100131011 is a prime number
BaseRepresentation
bin1000010101000101101…
…1101011011011000011
3111200100220010212000021
42011101123223123003
54321032113143021
6145423404234311
713224104021065
oct2052133533303
9450326125007
10143100131011
1155763325492
1223897b3b997
1310656c34846
146cd725b735
153ac7e93c41
hex21516eb6c3

143100131011 has 2 divisors, whose sum is σ = 143100131012. Its totient is φ = 143100131010.

The previous prime is 143100130981. The next prime is 143100131023. The reversal of 143100131011 is 110131001341.

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

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 143100131011 - 215 = 143100098243 is a prime.

It is not a weakly prime, because it can be changed into another prime (143100138011) 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, 71550065505 + 71550065506.

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

Almost surely, 2143100131011 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 36, while the sum is 16.

Adding to 143100131011 its reverse (110131001341), we get a palindrome (253231132352).

The spelling of 143100131011 in words is "one hundred forty-three billion, one hundred million, one hundred thirty-one thousand, eleven".