Search a number
-
+
108910197155200 = 2752721740857667
BaseRepresentation
bin11000110000110110100001…
…100111010010010110000000
3112021121201020220020011121011
4120300312201213102112000
5103233341040432431300
61023344353122410304
731640334133262500
oct3060664147222600
9467551226204534
10108910197155200
113177a6120138a1
121026b638800994
1348a0258cb2b3c
141cc73d2c7ba00
15c8d00e0b5eba
hex630da19d2580

108910197155200 has 288 divisors, whose sum is σ = 331377342044040. Its totient is φ = 35144129986560.

The previous prime is 108910197155171. The next prime is 108910197155213. The reversal of 108910197155200 is 2551791019801.

It is a super-2 number, since 2×1089101971552002 (a number of 29 digits) contains 22 as substring.

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

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 in 35 ways as a sum of consecutive naturals, for example, 17763234 + ... + 23094433.

Almost surely, 2108910197155200 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 226800, while the sum is 49.

The spelling of 108910197155200 in words is "one hundred eight trillion, nine hundred ten billion, one hundred ninety-seven million, one hundred fifty-five thousand, two hundred".