Base | Representation |
---|---|
bin | 110011101111111101… |
… | …1100011001001010100 |
3 | 101121211220210102100212 |
4 | 1213133323203021110 |
5 | 3310044031041040 |
6 | 123015233224552 |
7 | 11012634603065 |
oct | 1473773431124 |
9 | 347756712325 |
10 | 111131112020 |
11 | 43148685335 |
12 | 19655702158 |
13 | a630951a66 |
14 | 554350056c |
15 | 2d56576d65 |
hex | 19dfee3254 |
111131112020 has 48 divisors (see below), whose sum is σ = 236057749200. Its totient is φ = 43941765120.
The previous prime is 111131112013. The next prime is 111131112031. The reversal of 111131112020 is 20211131111.
It can be written as a sum of positive squares in 8 ways, for example, as 576192016 + 110554920004 = 24004^2 + 332498^2 .
It is a junction number, because it is equal to n+sod(n) for n = 111131111986 and 111131112004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12386096 + ... + 12395064.
It is an arithmetic number, because the mean of its divisors is an integer number (4917869775).
Almost surely, 2111131112020 is an apocalyptic number.
111131112020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111131112020 is an abundant number, since it is smaller than the sum of its proper divisors (124926637180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111131112020 is a wasteful number, since it uses less digits than its factorization.
111131112020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16028 (or 16026 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 111131112020 its reverse (20211131111), we get a palindrome (131342243131).
The spelling of 111131112020 in words is "one hundred eleven billion, one hundred thirty-one million, one hundred twelve thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •