Base | Representation |
---|---|
bin | 110011110101010111… |
… | …0000010100101010000 |
3 | 101122022112101120211110 |
4 | 1213222232002211100 |
5 | 3310431400321034 |
6 | 123045221013320 |
7 | 11020263260421 |
oct | 1475256024520 |
9 | 348275346743 |
10 | 111312120144 |
11 | 43230876425 |
12 | 196a6254240 |
13 | a65c2b9764 |
14 | 555d57b648 |
15 | 2d673cdde9 |
hex | 19eab82950 |
111312120144 has 40 divisors (see below), whose sum is σ = 288357347520. Its totient is φ = 37000680448.
The previous prime is 111312120137. The next prime is 111312120167. The reversal of 111312120144 is 441021213111.
It is a self number, because there is not a number n which added to its sum of digits gives 111312120144.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3212577 + ... + 3247040.
It is an arithmetic number, because the mean of its divisors is an integer number (7208933688).
Almost surely, 2111312120144 is an apocalyptic number.
It is an amenable number.
111312120144 is an abundant number, since it is smaller than the sum of its proper divisors (177045227376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111312120144 is a wasteful number, since it uses less digits than its factorization.
111312120144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6459987 (or 6459981 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 111312120144 its reverse (441021213111), we get a palindrome (552333333255).
It can be divided in two parts, 1113121 and 20144, that added together give a triangular number (1133265 = T1505).
The spelling of 111312120144 in words is "one hundred eleven billion, three hundred twelve million, one hundred twenty thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •