Search a number
-
+
101110021111200 = 253522310317783527
BaseRepresentation
bin10110111111010110000010…
…111001000011110110100000
3111021000000122012212111021010
4112333112002321003312200
5101223041310401024300
6555013145155300520
730203646402666363
oct2677260271036640
9437000565774233
10101110021111200
112a242578a91352
12b40b9715aa740
1344558320c07ca
141ad7a731760da
15ba5184deda50
hex5bf582e43da0

101110021111200 has 288 divisors, whose sum is σ = 346756602157056. Its totient is φ = 25539988700160.

The previous prime is 101110021111157. The next prime is 101110021111201. The reversal of 101110021111200 is 2111120011101.

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

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

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

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3206164 + ... + 14577363.

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

Almost surely, 2101110021111200 is an apocalyptic number.

101110021111200 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 101110021111200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (173378301078528).

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

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

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

101110021111200 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 101110021111200 its reverse (2111120011101), we get a palindrome (103221141122301).

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