Search a number
-
+
110101020011100 = 223252192338876639
BaseRepresentation
bin11001000010001011100100…
…001011111110101001011100
3112102211112222101112001112200
4121002023210023332221130
5103412343342110323400
61030055413233131500
732122351625452416
oct3102134413765134
9472745871461480
10110101020011100
1132099642517778
12104223949b9b90
134958635206561
141d28cbc63b9b6
15cadea8282b00
hex6422e42fea5c

110101020011100 has 162 divisors, whose sum is σ = 364224951548640. Its totient is φ = 27814994447040.

The previous prime is 110101020011083. The next prime is 110101020011131. The reversal of 110101020011100 is 1110020101011.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 53 ways as a sum of consecutive naturals, for example, 169113420 + ... + 169763219.

Almost surely, 2110101020011100 is an apocalyptic number.

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

It is an amenable number.

110101020011100 is an abundant number, since it is smaller than the sum of its proper divisors (254123931537540).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

Adding to 110101020011100 its reverse (1110020101011), we get a palindrome (111211040112111).

The spelling of 110101020011100 in words is "one hundred ten trillion, one hundred one billion, twenty million, eleven thousand, one hundred".