Search a number
-
+
10143434113 = 67151394539
BaseRepresentation
bin10010111001001100…
…01000010110000001
3222011220122211201221
421130212020112001
5131233204342423
64354304555041
7506235524131
oct113446102601
928156584657
1010143434113
1143357821aa
121b71022a81
13c5862a927
146c321cac1
153e5791e5d
hex25c988581

10143434113 has 4 divisors (see below), whose sum is σ = 10294828720. Its totient is φ = 9992039508.

The previous prime is 10143434101. The next prime is 10143434137. The reversal of 10143434113 is 31143434101.

It is a happy number.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 10143434113 - 217 = 10143303041 is a prime.

It is not an unprimeable number, because it can be changed into a prime (10143434713) by changing a digit.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 75697203 + ... + 75697336.

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

Almost surely, 210143434113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 151394606.

The product of its (nonzero) digits is 1728, while the sum is 25.

Adding to 10143434113 its reverse (31143434101), we get a palindrome (41286868214).

The spelling of 10143434113 in words is "ten billion, one hundred forty-three million, four hundred thirty-four thousand, one hundred thirteen".

Divisors: 1 67 151394539 10143434113