Search a number
-
+
14100211113 = 313734307083
BaseRepresentation
bin11010010000111000…
…00010010110101001
31100101200000221101020
431020130002112221
5212334123223423
610251052243053
71006262550132
oct151034022651
940350027336
1014100211113
115a8622433a
122896170489
1314392c77b1
1497a920c89
15577d2a4e3
hex3487025a9

14100211113 has 8 divisors (see below), whose sum is σ = 18937510368. Its totient is φ = 9331526304.

The previous prime is 14100211109. The next prime is 14100211123. The reversal of 14100211113 is 31111200141.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 14100211113 - 22 = 14100211109 is a prime.

It is a Curzon number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17153131 + ... + 17153952.

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

Almost surely, 214100211113 is an apocalyptic number.

It is an amenable number.

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

14100211113 is a wasteful number, since it uses less digits than its factorization.

14100211113 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 34307223.

The product of its (nonzero) digits is 24, while the sum is 15.

Adding to 14100211113 its reverse (31111200141), we get a palindrome (45211411254).

The spelling of 14100211113 in words is "fourteen billion, one hundred million, two hundred eleven thousand, one hundred thirteen".

Divisors: 1 3 137 411 34307083 102921249 4700070371 14100211113