Search a number
-
+
110145031100 = 2252131947791201
BaseRepresentation
bin110011010010100100…
…1111100101110111100
3101112022012022022122022
41212211021330232330
53301034111443400
6122333330135312
710646332213436
oct1464511745674
9345265268568
10110145031100
1142791aa9125
121941b421538
13a504579220
14548c577656
152ce9be4b85
hex19a527cbbc

110145031100 has 288 divisors, whose sum is σ = 280448716800. Its totient is φ = 37200384000.

The previous prime is 110145031037. The next prime is 110145031103. The reversal of 110145031100 is 1130541011.

It is a congruent number.

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

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 91710500 + ... + 91711700.

Almost surely, 2110145031100 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 60, while the sum is 17.

Adding to 110145031100 its reverse (1130541011), we get a palindrome (111275572111).

The spelling of 110145031100 in words is "one hundred ten billion, one hundred forty-five million, thirty-one thousand, one hundred".