Search a number
-
+
101113211751552 = 273671121398411
BaseRepresentation
bin10110111111011001000001…
…000100011000110010000000
3111021000022212120121211000000
4112333121001010120302000
5101223114324202022202
6555014433534000000
730204121434665010
oct2677310104306200
9437008776554000
10101113211751552
112a243966021700
12b410502046000
134455c20133090
141ad7c96c05c40
15ba52c009d91c
hex5bf641118c80

101113211751552 has 1344 divisors, whose sum is σ = 408580903039680. Its totient is φ = 24242681548800.

The previous prime is 101113211751547. The next prime is 101113211751553. The reversal of 101113211751552 is 255157112311101.

101113211751552 is a `hidden beast` number, since 1 + 0 + 1 + 1 + 1 + 32 + 1 + 1 + 75 + 1 + 552 = 666.

It is a tau number, because it is divible by the number of its divisors (1344).

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

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

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 in 167 ways as a sum of consecutive naturals, for example, 1027409227 + ... + 1027507637.

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

Almost surely, 2101113211751552 is an apocalyptic number.

101113211751552 is a gapful number since it is divisible by the number (12) 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 101113211751552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (204290451519840).

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

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

101113211751552 is an equidigital number, since it uses as much as digits as its factorization.

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

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

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

The spelling of 101113211751552 in words is "one hundred one trillion, one hundred thirteen billion, two hundred eleven million, seven hundred fifty-one thousand, five hundred fifty-two".