Search a number
-
+
11022022010 = 254912244811
BaseRepresentation
bin10100100001111011…
…01011010101111010
31001110010212201202102
422100331223111322
5140033114201020
65021412103402
7540064432646
oct122075532572
931403781672
1011022022010
11474670a2aa
122177304b62
13106866821c
14767ba3c26
1544798e475
hex290f6b57a

11022022010 has 16 divisors (see below), whose sum is σ = 19880055072. Its totient is φ = 4399827600.

The previous prime is 11022021991. The next prime is 11022022013. The reversal of 11022022010 is 1022022011.

It is a happy number.

It is a junction number, because it is equal to n+sod(n) for n = 11022021982 and 11022022000.

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

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

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

Almost surely, 211022022010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 2245309.

The product of its (nonzero) digits is 16, while the sum is 11.

Adding to 11022022010 its reverse (1022022011), we get a palindrome (12044044021).

Subtracting from 11022022010 its reverse (1022022011), we obtain a palindrome (9999999999).

The spelling of 11022022010 in words is "eleven billion, twenty-two million, twenty-two thousand, ten".

Divisors: 1 2 5 10 491 982 2455 4910 2244811 4489622 11224055 22448110 1102202201 2204404402 5511011005 11022022010