Base | Representation |
---|---|
bin | 11000001110101010010011… |
… | …000110110110101101110101 |
3 | 111222022002112220012012021212 |
4 | 120032222103012312231311 |
5 | 102431342110301131433 |
6 | 1014345133352051205 |
7 | 31305515112513155 |
oct | 3016522306665565 |
9 | 458262486165255 |
10 | 106560606661493 |
11 | 30a54110481916 |
12 | bb501ab693b05 |
13 | 475c81196c68a |
14 | 1c457bd0b6765 |
15 | c4bd44ec4d48 |
hex | 60ea931b6b75 |
106560606661493 has 8 divisors (see below), whose sum is σ = 106629324410880. Its totient is φ = 106491890044960.
The previous prime is 106560606661451. The next prime is 106560606661543. The reversal of 106560606661493 is 394166606065601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 106560606661493 - 238 = 106285728754549 is a prime.
It is a super-2 number, since 2×1065606066614932 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106560606661433) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 271865228 + ... + 272256906.
It is an arithmetic number, because the mean of its divisors is an integer number (13328665551360).
Almost surely, 2106560606661493 is an apocalyptic number.
It is an amenable number.
106560606661493 is a deficient number, since it is larger than the sum of its proper divisors (68717749387).
106560606661493 is a wasteful number, since it uses less digits than its factorization.
106560606661493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 566427.
The product of its (nonzero) digits is 25194240, while the sum is 59.
The spelling of 106560606661493 in words is "one hundred six trillion, five hundred sixty billion, six hundred six million, six hundred sixty-one thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •