Search a number
-
+
201100310132 = 2250275077533
BaseRepresentation
bin1011101101001010000…
…0110011011001110100
3201020002000201020020112
42323102200303121310
511243323134411012
6232214553322152
720346311301161
oct2732240633164
9636060636215
10201100310132
1178316978517
1232b84106358
1315c6b27b067
149a3a2a1068
15536ed6c122
hex2ed2833674

201100310132 has 6 divisors (see below), whose sum is σ = 351925542738. Its totient is φ = 100550155064.

The previous prime is 201100310113. The next prime is 201100310171. The reversal of 201100310132 is 231013001102.

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

It can be written as a sum of positive squares in only one way, i.e., 122966643556 + 78133666576 = 350666^2 + 279524^2 .

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

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

Almost surely, 2201100310132 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 36, while the sum is 14.

Adding to 201100310132 its reverse (231013001102), we get a palindrome (432113311234).

The spelling of 201100310132 in words is "two hundred one billion, one hundred million, three hundred ten thousand, one hundred thirty-two".

Divisors: 1 2 4 50275077533 100550155066 201100310132