Search a number
-
+
11021217150 = 235273474781
BaseRepresentation
bin10100100001110101…
…00110110101111110
31001110002100211200210
422100322212311332
5140032412422100
65021342533250
7540054541266
oct122072466576
931402324623
1011021217150
11474620a629
122176b97226
131068445a88
14767a347a6
15447880c50
hex290ea6d7e

11021217150 has 24 divisors (see below), whose sum is σ = 27332618904. Its totient is φ = 2938991200.

The previous prime is 11021217131. The next prime is 11021217161. The reversal of 11021217150 is 5171212011.

It is a Curzon number.

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 211021217150 is an apocalyptic number.

11021217150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

11021217150 is an abundant number, since it is smaller than the sum of its proper divisors (16311401754).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 73474796 (or 73474791 counting only the distinct ones).

The product of its (nonzero) digits is 140, while the sum is 21.

Adding to 11021217150 its reverse (5171212011), we get a palindrome (16192429161).

The spelling of 11021217150 in words is "eleven billion, twenty-one million, two hundred seventeen thousand, one hundred fifty".

Divisors: 1 2 3 5 6 10 15 25 30 50 75 150 73474781 146949562 220424343 367373905 440848686 734747810 1102121715 1836869525 2204243430 3673739050 5510608575 11021217150