Base | Representation |
---|---|
bin | 11001001111101111110110… |
… | …001100110011010111000100 |
3 | 112120010200102200110201222220 |
4 | 121033233312030303113010 |
5 | 104023132230002321012 |
6 | 1032052001354252340 |
7 | 32246615266565520 |
oct | 3117576614632704 |
9 | 476120380421886 |
10 | 111033330120132 |
11 | 32418a75246712 |
12 | 105530057270b0 |
13 | 49c552382bc74 |
14 | 1d5c082bacd80 |
15 | cc837210508c |
hex | 64fbf63335c4 |
111033330120132 has 48 divisors (see below), whose sum is σ = 296089398713472. Its totient is φ = 31723753063680.
The previous prime is 111033330120131. The next prime is 111033330120137. The reversal of 111033330120132 is 231021033330111.
It is not an unprimeable number, because it can be changed into a prime (111033330120131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 85564632 + ... + 86852592.
It is an arithmetic number, because the mean of its divisors is an integer number (6168529139864).
Almost surely, 2111033330120132 is an apocalyptic number.
111033330120132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
111033330120132 is an abundant number, since it is smaller than the sum of its proper divisors (185056068593340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111033330120132 is a wasteful number, since it uses less digits than its factorization.
111033330120132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2314268 (or 2314266 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 111033330120132 its reverse (231021033330111), we get a palindrome (342054363450243).
The spelling of 111033330120132 in words is "one hundred eleven trillion, thirty-three billion, three hundred thirty million, one hundred twenty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •