Search a number
-
+
1101051011001 = 32374332146813
BaseRepresentation
bin10000000001011011110…
…000010001111110111001
310220021000010201122210010
4100001123300101332321
5121014423024323001
62201452120212133
7142356033113364
oct20013360217671
93807003648703
101101051011001
11394a53656127
1215948390a049
137caa0765a86
143b410cd30db
151d992dab8d6
hex1005bc11fb9

1101051011001 has 16 divisors (see below), whose sum is σ = 1532103866496. Its totient is φ = 702024698496.

The previous prime is 1101051010999. The next prime is 1101051011063. The reversal of 1101051011001 is 1001101501011.

It is a happy number.

It is not a de Polignac number, because 1101051011001 - 21 = 1101051010999 is a prime.

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

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, 560530 + ... + 1586283.

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

Almost surely, 21101051011001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2154272.

The product of its (nonzero) digits is 5, while the sum is 12.

Adding to 1101051011001 its reverse (1001101501011), we get a palindrome (2102152512012).

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

Divisors: 1 3 23 69 7433 22299 170959 512877 2146813 6440439 49376699 148130097 15957261029 47871783087 367017003667 1101051011001