Base | Representation |
---|---|
bin | 110011111000101010… |
… | …1011100001110111000 |
3 | 101122121021020120012101 |
4 | 1213301111130032320 |
5 | 3311143304041440 |
6 | 123104223553144 |
7 | 11023111553245 |
oct | 1476125341670 |
9 | 348537216171 |
10 | 111423112120 |
11 | 43288495331 |
12 | 1971745b7b4 |
13 | a6792ab498 |
14 | 55701d05cc |
15 | 2d7200569a |
hex | 19f155c3b8 |
111423112120 has 128 divisors (see below), whose sum is σ = 264609504000. Its totient is φ = 42167910400.
The previous prime is 111423112103. The next prime is 111423112133. The reversal of 111423112120 is 21211324111.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11661345 + ... + 11670895.
It is an arithmetic number, because the mean of its divisors is an integer number (2067261750).
Almost surely, 2111423112120 is an apocalyptic number.
111423112120 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 111423112120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (132304752000).
111423112120 is an abundant number, since it is smaller than the sum of its proper divisors (153186391880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111423112120 is a wasteful number, since it uses less digits than its factorization.
111423112120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9793 (or 9789 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 111423112120 its reverse (21211324111), we get a palindrome (132634436231).
The spelling of 111423112120 in words is "one hundred eleven billion, four hundred twenty-three million, one hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •