Search a number
-
+
141110107401 = 317157167105529
BaseRepresentation
bin1000001101101011010…
…0010101110100001001
3111111020012120011211010
42003122310111310021
54302443141414101
6144454115154133
713123561060014
oct2033264256411
9444205504733
10141110107401
1154931a8227a
12234215a5949
13103ca871393
146b88c3c37b
153a0d4022d6
hex20dad15d09

141110107401 has 32 divisors (see below), whose sum is σ = 201685559040. Its totient is φ = 87448098816.

The previous prime is 141110107387. The next prime is 141110107409. The reversal of 141110107401 is 104701011141.

It is not a de Polignac number, because 141110107401 - 27 = 141110107273 is a prime.

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

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1284405 + ... + 1389933.

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

Almost surely, 2141110107401 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 105873.

The product of its (nonzero) digits is 112, while the sum is 21.

Adding to 141110107401 its reverse (104701011141), we get a palindrome (245811118542).

The spelling of 141110107401 in words is "one hundred forty-one billion, one hundred ten million, one hundred seven thousand, four hundred one".

Divisors: 1 3 17 51 157 167 471 501 2669 2839 8007 8517 26219 78657 105529 316587 445723 1337169 1793993 5381979 16568053 17623343 49704159 52870029 281656901 299596831 844970703 898790493 2766864851 8300594553 47036702467 141110107401