Search a number
-
+
11013131132 = 222753282783
BaseRepresentation
bin10100100000110111…
…10000101101111100
31001102112011000202122
422100123300231330
5140023330144012
65020453342112
7536626033013
oct122033605574
931375130678
1011013131132
114741697473
122174337938
131066874453
1476692ba7a
15446cd4e72
hex2906f0b7c

11013131132 has 6 divisors (see below), whose sum is σ = 19272979488. Its totient is φ = 5506565564.

The previous prime is 11013131123. The next prime is 11013131137. The reversal of 11013131132 is 23113131011.

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

It is a self number, because there is not a number n which added to its sum of digits gives 11013131132.

It is a congruent number.

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

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 as a sum of consecutive naturals, namely, 1376641388 + ... + 1376641395.

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

Almost surely, 211013131132 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 54, while the sum is 17.

Adding to 11013131132 its reverse (23113131011), we get a palindrome (34126262143).

The spelling of 11013131132 in words is "eleven billion, thirteen million, one hundred thirty-one thousand, one hundred thirty-two".

Divisors: 1 2 4 2753282783 5506565566 11013131132