Base | Representation |
---|---|
bin | 10000000110100001100… |
… | …100001011100000000110 |
3 | 10220210010002100101201012 |
4 | 100012201210023200012 |
5 | 121112121401224032 |
6 | 2204154344002222 |
7 | 142641346052060 |
oct | 20064144134006 |
9 | 3823102311635 |
10 | 1106517211142 |
11 | 3972a9134202 |
12 | 15a54a460372 |
13 | 80462074025 |
14 | 3b7acc6c730 |
15 | 1dbb2c016b2 |
hex | 101a190b806 |
1106517211142 has 96 divisors (see below), whose sum is σ = 2001537368064. Its totient is φ = 449189072640.
The previous prime is 1106517211109. The next prime is 1106517211147. The reversal of 1106517211142 is 2411127156011.
It is a junction number, because it is equal to n+sod(n) for n = 1106517211099 and 1106517211108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1106517211147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 140470508 + ... + 140478384.
It is an arithmetic number, because the mean of its divisors is an integer number (20849347584).
Almost surely, 21106517211142 is an apocalyptic number.
1106517211142 is a deficient number, since it is larger than the sum of its proper divisors (895020156922).
1106517211142 is a wasteful number, since it uses less digits than its factorization.
1106517211142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8142 (or 8101 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 32.
The spelling of 1106517211142 in words is "one trillion, one hundred six billion, five hundred seventeen million, two hundred eleven thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •