Search a number
-
+
1101001100133 = 311291150471369
BaseRepresentation
bin10000000001011000110…
…001111000101101100101
310220020212122210220221110
4100001120301320231211
5121014322240201013
62201443134335233
7142354555636554
oct20013061705545
93806778726843
101101001100133
11394a28466380
1215946b05a519
137ca9330c10c
143b40841dd9b
151d98d7ed2c3
hex10058c78b65

1101001100133 has 16 divisors (see below), whose sum is σ = 1656678772800. Its totient is φ = 644263966080.

The previous prime is 1101001100131. The next prime is 1101001100141. The reversal of 1101001100133 is 3310011001011.

It is not a de Polignac number, because 1101001100133 - 21 = 1101001100131 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 21101001100133 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1150471412.

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

Adding to 1101001100133 its reverse (3310011001011), we get a palindrome (4411012101144).

The spelling of 1101001100133 in words is "one trillion, one hundred one billion, one million, one hundred thousand, one hundred thirty-three".

Divisors: 1 3 11 29 33 87 319 957 1150471369 3451414107 12655185059 33363669701 37965555177 100091009103 367000366711 1101001100133