Search a number
-
+
1100101050051 = 32324977638327
BaseRepresentation
bin10000000000100011001…
…000011101111011000011
310220011112221012122100020
4100000203020131323003
5121011001332100201
62201213543224523
7142323346432053
oct20004310357303
93804487178306
101100101050051
113946063aa433
12159259748143
137c97b9c89c3
143b360a8d563
151d9397b1a36
hex1002321dec3

1100101050051 has 16 divisors (see below), whose sum is σ = 1530639051264. Its totient is φ = 701484527744.

The previous prime is 1100101050029. The next prime is 1100101050071. The reversal of 1100101050051 is 1500501010011.

It is a cyclic number.

It is not a de Polignac number, because 1100101050051 - 27 = 1100101049923 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1100101050051.

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

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

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

Almost surely, 21100101050051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 663330.

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

Adding to 1100101050051 its reverse (1500501010011), we get a palindrome (2600602060062).

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

Divisors: 1 3 23 69 24977 74931 574471 638327 1723413 1914981 14681521 44044563 15943493479 47830480437 366700350017 1100101050051