Search a number
-
+
10000110141 = 327179337171
BaseRepresentation
bin10010101000000110…
…11001001000111101
3221210220222020012200
421110003121020331
5130440012011031
64332145022113
7502545351030
oct112403311075
927726866180
1010000110141
11427188a83a
121b31024939
13c34a28648
146ac191017
153d7dd08e6
hex2540d923d

10000110141 has 24 divisors (see below), whose sum is σ = 17479185984. Its totient is φ = 5378209920.

The previous prime is 10000110137. The next prime is 10000110163. The reversal of 10000110141 is 14101100001.

It is not a de Polignac number, because 10000110141 - 22 = 10000110137 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a congruent number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4667515 + ... + 4669656.

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

Almost surely, 210000110141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 9337201 (or 9337198 counting only the distinct ones).

The product of its (nonzero) digits is 4, while the sum is 9.

Adding to 10000110141 its reverse (14101100001), we get a palindrome (24101210142).

The spelling of 10000110141 in words is "ten billion, one hundred ten thousand, one hundred forty-one".

Divisors: 1 3 7 9 17 21 51 63 119 153 357 1071 9337171 28011513 65360197 84034539 158731907 196080591 476195721 588241773 1111123349 1428587163 3333370047 10000110141