Base | Representation |
---|---|
bin | 11000001000000011010011… |
… | …101111100011111110111001 |
3 | 111220200200020011101221000210 |
4 | 120020003103233203332321 |
5 | 102401421424140303423 |
6 | 1013400341333021333 |
7 | 31230636054263463 |
oct | 3010032357437671 |
9 | 456620204357023 |
10 | 106106424541113 |
11 | 30899533512537 |
12 | ba98176a84849 |
13 | 4728a40005b99 |
14 | 1c2b814dc3133 |
15 | c401119d9b93 |
hex | 6080d3be3fb9 |
106106424541113 has 16 divisors (see below), whose sum is σ = 147378756800000. Its totient is φ = 67827723287040.
The previous prime is 106106424541099. The next prime is 106106424541127. The reversal of 106106424541113 is 311145424601601.
It is an interprime number because it is at equal distance from previous prime (106106424541099) and next prime (106106424541127).
It is not a de Polignac number, because 106106424541113 - 213 = 106106424532921 is a prime.
It is a super-2 number, since 2×1061064245411132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106106424542113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5233610488 + ... + 5233630761.
It is an arithmetic number, because the mean of its divisors is an integer number (9211172300000).
Almost surely, 2106106424541113 is an apocalyptic number.
It is an amenable number.
106106424541113 is a deficient number, since it is larger than the sum of its proper divisors (41272332258887).
106106424541113 is a wasteful number, since it uses less digits than its factorization.
106106424541113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10467241392.
The product of its (nonzero) digits is 69120, while the sum is 39.
The spelling of 106106424541113 in words is "one hundred six trillion, one hundred six billion, four hundred twenty-four million, five hundred forty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •