Base | Representation |
---|---|
bin | 11000000000101100101100… |
… | …011000110100100011111101 |
3 | 111211220100220121200120100212 |
4 | 120000230230120310203331 |
5 | 102320132031014023010 |
6 | 1012332251142402205 |
7 | 31146266561245214 |
oct | 3000545430644375 |
9 | 454810817616325 |
10 | 105601105611005 |
11 | 307141a5114134 |
12 | ba16250730365 |
13 | 46c01abc312b4 |
14 | 1c111995dc07b |
15 | c31dd8e52505 |
hex | 600b2c6348fd |
105601105611005 has 8 divisors (see below), whose sum is σ = 133390870245600. Its totient is φ = 80034522147216.
The previous prime is 105601105610977. The next prime is 105601105611013. The reversal of 105601105611005 is 500116501106501.
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 105601105611005 - 210 = 105601105609981 is a prime.
It is a super-2 number, since 2×1056011056110052 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 555795292595 + ... + 555795292784.
It is an arithmetic number, because the mean of its divisors is an integer number (16673858780700).
Almost surely, 2105601105611005 is an apocalyptic number.
It is an amenable number.
105601105611005 is a deficient number, since it is larger than the sum of its proper divisors (27789764634595).
105601105611005 is a wasteful number, since it uses less digits than its factorization.
105601105611005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1111590585403.
The product of its (nonzero) digits is 4500, while the sum is 32.
Adding to 105601105611005 its reverse (500116501106501), we get a palindrome (605717606717506).
The spelling of 105601105611005 in words is "one hundred five trillion, six hundred one billion, one hundred five million, six hundred eleven thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •