Search a number
-
+
1110010011022 = 21150455000501
BaseRepresentation
bin10000001001110001110…
…000001001110110001110
310221010010111200000101201
4100021301300021312032
5121141300030323042
62205533114500114
7143124040263103
oct20116160116616
93833114600351
101110010011022
11398830793480
1215b16413463a
138089a88c313
143ba20ab4aaa
151dd1968a1b7
hex10271c09d8e

1110010011022 has 8 divisors (see below), whose sum is σ = 1816380018072. Its totient is φ = 504550005000.

The previous prime is 1110010011017. The next prime is 1110010011037. The reversal of 1110010011022 is 2201100100111.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a super-2 number, since 2×11100100110222 (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 3 ways as a sum of consecutive naturals, for example, 25227500229 + ... + 25227500272.

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

Almost surely, 21110010011022 is an apocalyptic number.

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

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

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

The sum of its prime factors is 50455000514.

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

Adding to 1110010011022 its reverse (2201100100111), we get a palindrome (3311110111133).

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

Divisors: 1 2 11 22 50455000501 100910001002 555005005511 1110010011022