Base | Representation |
---|---|
bin | 110011111100000010… |
… | …1011011001101011110 |
3 | 101122220011022212001100 |
4 | 1213320011123031132 |
5 | 3311411301313032 |
6 | 123123351053530 |
7 | 11025655240023 |
oct | 1477005331536 |
9 | 348804285040 |
10 | 111536354142 |
11 | 43336400784 |
12 | 197493712a6 |
13 | a6968aa3b5 |
14 | 558126b54a |
15 | 2d7be2397c |
hex | 19f815b35e |
111536354142 has 24 divisors (see below), whose sum is σ = 245623776840. Its totient is φ = 36569296080.
The previous prime is 111536354023. The next prime is 111536354161. The reversal of 111536354142 is 241453635111.
111536354142 is a `hidden beast` number, since 1 + 1 + 1 + 5 + 3 + 635 + 4 + 14 + 2 = 666.
111536354142 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 111536354097 and 111536354106.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 50789592 + ... + 50791787.
It is an arithmetic number, because the mean of its divisors is an integer number (10234324035).
Almost surely, 2111536354142 is an apocalyptic number.
111536354142 is an abundant number, since it is smaller than the sum of its proper divisors (134087422698).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111536354142 is a wasteful number, since it uses less digits than its factorization.
111536354142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101581448 (or 101581445 counting only the distinct ones).
The product of its digits is 43200, while the sum is 36.
Adding to 111536354142 its reverse (241453635111), we get a palindrome (352989989253).
The spelling of 111536354142 in words is "one hundred eleven billion, five hundred thirty-six million, three hundred fifty-four thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •