Search a number
-
+
10113145 = 57288947
BaseRepresentation
bin100110100101…
…000001111001
3201000210121221
4212211001321
510042110040
61000432041
7151650250
oct46450171
921023557
1010113145
115788179
123478621
132131213
1414b3797
15d4b74a
hex9a5079

10113145 has 8 divisors (see below), whose sum is σ = 13869504. Its totient is φ = 6934704.

The previous prime is 10113143. The next prime is 10113151. The reversal of 10113145 is 54131101.

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

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

It is not a de Polignac number, because 10113145 - 21 = 10113143 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 210113145 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 288959.

The product of its (nonzero) digits is 60, while the sum is 16.

The square root of 10113145 is about 3180.1171362074. The cubic root of 10113145 is about 216.2529686518.

Adding to 10113145 its reverse (54131101), we get a palindrome (64244246).

The spelling of 10113145 in words is "ten million, one hundred thirteen thousand, one hundred forty-five".

Divisors: 1 5 7 35 288947 1444735 2022629 10113145