Search a number
-
+
1101005051 = 1764765003
BaseRepresentation
bin100000110100000…
…0000000011111011
32211201201211222212
41001220000003323
54223324130201
6301130205335
736166250156
oct10150000373
92751654885
101101005051
11515541433
1226888384b
131471432a3
14a6320c9d
15669d3abb
hex41a000fb

1101005051 has 4 divisors (see below), whose sum is σ = 1165770072. Its totient is φ = 1036240032.

The previous prime is 1101005011. The next prime is 1101005057. The reversal of 1101005051 is 1505001011.

It is a semiprime because it is the product of two primes.

It is a de Polignac number, because none of the positive numbers 2k-1101005051 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (1101005057) 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 3 ways as a sum of consecutive naturals, for example, 32382485 + ... + 32382518.

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

Almost surely, 21101005051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 64765020.

The product of its (nonzero) digits is 25, while the sum is 14.

The square root of 1101005051 is about 33181.3961580883. The cubic root of 1101005051 is about 1032.5944119238.

Adding to 1101005051 its reverse (1505001011), we get a palindrome (2606006062).

The spelling of 1101005051 in words is "one billion, one hundred one million, five thousand, fifty-one".

Divisors: 1 17 64765003 1101005051