Search a number
-
+
11011011201 = 3211310826953
BaseRepresentation
bin10100100000100111…
…01011001010000001
31001102101011022202200
422100103223022001
5140022304324301
65020340103413
7536602023321
oct122023531201
931371138680
1011011011201
114740479763
122173694b69
1310662b1558
14766539281
15446a16c86
hex2904eb281

11011011201 has 12 divisors (see below), whose sum is σ = 16045545828. Its totient is φ = 7275711744.

The previous prime is 11011011173. The next prime is 11011011227. The reversal of 11011011201 is 10211011011.

It can be written as a sum of positive squares in 2 ways, for example, as 4924670976 + 6086340225 = 70176^2 + 78015^2 .

It is not a de Polignac number, because 11011011201 - 217 = 11010880129 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5412460 + ... + 5414493.

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

Almost surely, 211011011201 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 2, while the sum is 9.

Adding to 11011011201 its reverse (10211011011), we get a palindrome (21222022212).

The spelling of 11011011201 in words is "eleven billion, eleven million, eleven thousand, two hundred one".

Divisors: 1 3 9 113 339 1017 10826953 32480859 97442577 1223445689 3670337067 11011011201