Base | Representation |
---|---|
bin | 110011110110101000… |
… | …0100100011011111101 |
3 | 101122102111120012021100 |
4 | 1213231100210123331 |
5 | 3311023302214031 |
6 | 123053342123313 |
7 | 11021321361231 |
oct | 1475520443375 |
9 | 348374505240 |
10 | 111354726141 |
11 | 4325292699a |
12 | 196b8580539 |
13 | a6680864c9 |
14 | 55650ac5c1 |
15 | 2d6aee7de6 |
hex | 19ed4246fd |
111354726141 has 24 divisors (see below), whose sum is σ = 166828520664. Its totient is φ = 71514921600.
The previous prime is 111354726139. The next prime is 111354726151. The reversal of 111354726141 is 141627453111.
111354726141 is a `hidden beast` number, since 1 + 1 + 1 + 35 + 4 + 7 + 2 + 614 + 1 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 102243260025 + 9111466116 = 319755^2 + 95454^2 .
It is not a de Polignac number, because 111354726141 - 21 = 111354726139 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111354726096 and 111354726105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111354726151) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1621806 + ... + 1689071.
It is an arithmetic number, because the mean of its divisors is an integer number (6951188361).
Almost surely, 2111354726141 is an apocalyptic number.
It is an amenable number.
111354726141 is a deficient number, since it is larger than the sum of its proper divisors (55473794523).
111354726141 is a wasteful number, since it uses less digits than its factorization.
111354726141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3311021 (or 3311018 counting only the distinct ones).
The product of its digits is 20160, while the sum is 36.
The spelling of 111354726141 in words is "one hundred eleven billion, three hundred fifty-four million, seven hundred twenty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •