Base | Representation |
---|---|
bin | 110001010111001101… |
… | …1100000001101111001 |
3 | 101010121201100111201110 |
4 | 1202232123200031321 |
5 | 3214044422114122 |
6 | 120410501110533 |
7 | 10441630150620 |
oct | 1425633401571 |
9 | 333551314643 |
10 | 106005660537 |
11 | 40a58482817 |
12 | 186650b8449 |
13 | 9cc4b0ab2a |
14 | 51b89046b7 |
15 | 2b565de90c |
hex | 18ae6e0379 |
106005660537 has 8 divisors (see below), whose sum is σ = 161532435136. Its totient is φ = 60574663152.
The previous prime is 106005660443. The next prime is 106005660557. The reversal of 106005660537 is 735066500601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106005660537 - 212 = 106005656441 is a prime.
It is a super-2 number, since 2×1060056605372 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 106005660495 and 106005660504.
It is not an unprimeable number, because it can be changed into a prime (106005660557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2523944278 + ... + 2523944319.
It is an arithmetic number, because the mean of its divisors is an integer number (20191554392).
Almost surely, 2106005660537 is an apocalyptic number.
It is an amenable number.
106005660537 is a deficient number, since it is larger than the sum of its proper divisors (55526774599).
106005660537 is an equidigital number, since it uses as much as digits as its factorization.
106005660537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5047888607.
The product of its (nonzero) digits is 113400, while the sum is 39.
The spelling of 106005660537 in words is "one hundred six billion, five million, six hundred sixty thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •