| Base | Representation |
|---|---|
| bin | 11001001111101100110111… |
| … | …100100111100010100000000 |
| 3 | 112120010101011210122101221010 |
| 4 | 121033230313210330110000 |
| 5 | 104023104202243000000 |
| 6 | 1032050312151400520 |
| 7 | 32246443114165233 |
| oct | 3117546744742400 |
| 9 | 476111153571833 |
| 10 | 111030132000000 |
| 11 | 32417683a67724 |
| 12 | 10552472683140 |
| 13 | 49c513409aca5 |
| 14 | 1d5bc5c15341a |
| 15 | cc8236478d50 |
| hex | 64fb3793c500 |
111030132000000 has 504 divisors, whose sum is σ = 378383630377536. Its totient is φ = 28885760000000.
The previous prime is 111030131999921. The next prime is 111030132000001. The reversal of 111030132000000 is 231030111.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a self number, because there is not a number n which added to its sum of digits gives 111030132000000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111030132000001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 491887165 + ... + 492112835.
It is an arithmetic number, because the mean of its divisors is an integer number (750761171384).
Almost surely, 2111030132000000 is an apocalyptic number.
111030132000000 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 111030132000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (189191815188768).
111030132000000 is an abundant number, since it is smaller than the sum of its proper divisors (267353498377536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111030132000000 is an frugal number, since it uses more digits than its factorization.
111030132000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 225761 (or 225722 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 111030132000000 its reverse (231030111), we get a palindrome (111030363030111).
The spelling of 111030132000000 in words is "one hundred eleven trillion, thirty billion, one hundred thirty-two million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •