Search a number
-
+
101110112011020 = 2235710712717715679
BaseRepresentation
bin10110111111010110001000…
…010011110100001100001100
3111021000000212112220200101010
4112333112020103310030030
5101223042002133323040
6555013202203445220
730203651555430420
oct2677261023641414
9437000775820333
10101110112011020
112a242615327772
12b40b997b26810
134455847b99198
141ad7a81278b80
15ba518cda6e80
hex5bf5884f430c

101110112011020 has 192 divisors, whose sum is σ = 329147697070080. Its totient is φ = 22714617155328.

The previous prime is 101110112010989. The next prime is 101110112011021. The reversal of 101110112011020 is 20110211011101.

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

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

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

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

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

Almost surely, 2101110112011020 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 101110112011020, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (164573848535040).

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

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

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

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

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

The product of its (nonzero) digits is 4, while the sum is 12.

Adding to 101110112011020 its reverse (20110211011101), we get a palindrome (121220323022121).

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