Search a number
-
+
1101001055 = 57112859743
BaseRepresentation
bin100000110011111…
…1111000101011111
32211201201122111212
41001213333011133
54223324013210
6301130135035
736166232420
oct10147770537
92751648455
101101001055
11515539430
1226888147b
1314714151b
14a631d647
15669d2805
hex419ff15f

1101001055 has 16 divisors (see below), whose sum is σ = 1647212544. Its totient is φ = 686338080.

The previous prime is 1101001049. The next prime is 1101001067. The reversal of 1101001055 is 5501001011.

It is not a de Polignac number, because 1101001055 - 28 = 1101000799 is a prime.

It is a super-2 number, since 2×11010010552 = 2424406646222226050, which contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1429487 + ... + 1430256.

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

Almost surely, 21101001055 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2859766.

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

The square root of 1101001055 is about 33181.3359435692. The cubic root of 1101001055 is about 1032.5931626857.

Adding to 1101001055 its reverse (5501001011), we get a palindrome (6602002066).

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

Divisors: 1 5 7 11 35 55 77 385 2859743 14298715 20018201 31457173 100091005 157285865 220200211 1101001055