Search a number
-
+
1101010011022 = 217257126002519
BaseRepresentation
bin10000000001011001010…
…011111000001110001110
310220020220021120122101101
4100001121103320032032
5121014332030323042
62201444053333314
7142355024452045
oct20013123701616
93806807518341
101101010011022
11394a324a2249
1215947203723a
137ca9510c02c
143b40969d55c
151d98e4ad6b7
hex100594f838e

1101010011022 has 16 divisors (see below), whose sum is σ = 1755467108640. Its totient is φ = 516106313728.

The previous prime is 1101010011001. The next prime is 1101010011047. The reversal of 1101010011022 is 2201100101011.

It is a super-2 number, since 2×11010100110222 (a number of 25 digits) contains 22 as substring.

It is a congruent number.

It is an unprimeable number.

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 7 ways as a sum of consecutive naturals, for example, 62992522 + ... + 63009997.

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

Almost surely, 21101010011022 is an apocalyptic number.

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

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

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

The sum of its prime factors is 126002795.

The product of its (nonzero) digits is 4, while the sum is 10.

Adding to 1101010011022 its reverse (2201100101011), we get a palindrome (3302110112033).

The spelling of 1101010011022 in words is "one trillion, one hundred one billion, ten million, eleven thousand, twenty-two".

Divisors: 1 2 17 34 257 514 4369 8738 126002519 252005038 2142042823 4284085646 32382647383 64765294766 550505005511 1101010011022