Search a number
-
+
111030150000 = 243557119613
BaseRepresentation
bin110011101100111101…
…0011010001101110000
3101121120212211000111210
41213121322122031300
53304342204300000
6123001225240120
711010300463140
oct1473172321560
9347525730453
10111030150000
11430a6697050
1219627933040
13a615a62413
145533d3c920
152d4c782350
hex19d9e9a370

111030150000 has 480 divisors, whose sum is σ = 447022388736. Its totient is φ = 23068800000.

The previous prime is 111030149977. The next prime is 111030150013. The reversal of 111030150000 is 51030111.

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

It is a congruent number.

It is an unprimeable number.

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

Almost surely, 2111030150000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 111030150000 its reverse (51030111), we get a palindrome (111081180111).

The spelling of 111030150000 in words is "one hundred eleven billion, thirty million, one hundred fifty thousand".