Search a number
-
+
1101056113 = 8913989003
BaseRepresentation
bin100000110100000…
…1100100001110001
32211201211110001001
41001220030201301
54223332243423
6301131242001
736166552063
oct10150144161
92751743031
101101056113
11515576833
122688a9301
131471605c1
14a6335733
15669e3cad
hex41a0c871

1101056113 has 8 divisors (see below), whose sum is σ = 1121450400. Its totient is φ = 1080840288.

The previous prime is 1101056111. The next prime is 1101056149. The reversal of 1101056113 is 3116501011.

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

It is a cyclic number.

It is not a de Polignac number, because 1101056113 - 21 = 1101056111 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (1101056111) 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, 32131 + ... + 56872.

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

Almost surely, 21101056113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 89231.

The product of its (nonzero) digits is 90, while the sum is 19.

The square root of 1101056113 is about 33182.1655863507. The cubic root of 1101056113 is about 1032.6103747693.

Adding to 1101056113 its reverse (3116501011), we get a palindrome (4217557124).

The spelling of 1101056113 in words is "one billion, one hundred one million, fifty-six thousand, one hundred thirteen".

Divisors: 1 89 139 12371 89003 7921267 12371417 1101056113