Search a number
-
+
110527052172000 = 25353751110911059
BaseRepresentation
bin11001001000011000010101…
…101011101100101011100000
3112111100021122022012012220220
4121020120111223230223200
5103441333400324001000
61031023232105003040
732165213250204312
oct3110302553545340
9474307568165826
10110527052172000
1132243294575932
1210490a72183480
13498986bb689a9
141d41775ca77b2
15cba0e02841a0
hex648615aecae0

110527052172000 has 384 divisors, whose sum is σ = 362928509798400. Its totient is φ = 29405433600000.

The previous prime is 110527052171999. The next prime is 110527052172059. The reversal of 110527052172000 is 271250725011.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 9994302471 + ... + 9994313529.

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

Almost surely, 2110527052172000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 9800, while the sum is 33.

The spelling of 110527052172000 in words is "one hundred ten trillion, five hundred twenty-seven billion, fifty-two million, one hundred seventy-two thousand".