Search a number
-
+
11221015366 = 211510046153
BaseRepresentation
bin10100111001101001…
…10001101101000110
31001222000022122022201
422130310301231012
5140440034442431
65053241145114
7545032025341
oct123464615506
931860278281
1011221015366
114838a74a20
122211a8b19a
13109a95c282
147863a3458
1545a19a461
hex29cd31b46

11221015366 has 8 divisors (see below), whose sum is σ = 18361661544. Its totient is φ = 5100461520.

The previous prime is 11221015357. The next prime is 11221015381. The reversal of 11221015366 is 66351012211.

11221015366 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is a super-2 number, since 2×112210153662 (a number of 21 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, 255023055 + ... + 255023098.

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

Almost surely, 211221015366 is an apocalyptic number.

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

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

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

The sum of its prime factors is 510046166.

The product of its (nonzero) digits is 2160, while the sum is 28.

Adding to 11221015366 its reverse (66351012211), we get a palindrome (77572027577).

The spelling of 11221015366 in words is "eleven billion, two hundred twenty-one million, fifteen thousand, three hundred sixty-six".

Divisors: 1 2 11 22 510046153 1020092306 5610507683 11221015366