Search a number
-
+
10389141 = 34773251
BaseRepresentation
bin100111101000…
…011010010101
3201112211020000
4213220122111
510124423031
61010401513
7154210020
oct47503225
921484200
1010389141
115956574
123590299
1321c9a29
1415461b7
15da33e6
hex9e8695

10389141 has 40 divisors (see below), whose sum is σ = 18051264. Its totient is φ = 5832000.

The previous prime is 10389139. The next prime is 10389149. The reversal of 10389141 is 14198301.

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

It is not a de Polignac number, because 10389141 - 21 = 10389139 is a prime.

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

It is a Curzon number.

It is a congruent number.

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

It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 41266 + ... + 41516.

Almost surely, 210389141 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 864, while the sum is 27.

The square root of 10389141 is about 3223.2190431306. The cubic root of 10389141 is about 218.2025794164.

The spelling of 10389141 in words is "ten million, three hundred eighty-nine thousand, one hundred forty-one".

Divisors: 1 3 7 9 21 27 63 73 81 189 219 251 511 567 657 753 1533 1757 1971 2259 4599 5271 5913 6777 13797 15813 18323 20331 41391 47439 54969 128261 142317 164907 384783 494721 1154349 1484163 3463047 10389141