Base | Representation |
---|---|
bin | 10111111000000111001010… |
… | …111101110000010010000101 |
3 | 111202210221220100220122212010 |
4 | 113320013022331300102011 |
5 | 102231000123003343320 |
6 | 1011201225410244433 |
7 | 31055540655410364 |
oct | 2770071275602205 |
9 | 452727810818763 |
10 | 105011060606085 |
11 | 30506a390967a7 |
12 | b93ba1b886719 |
13 | 467966786462a |
14 | 1bd07c35237db |
15 | c218a3052ae0 |
hex | 5f81caf70485 |
105011060606085 has 16 divisors (see below), whose sum is σ = 168525303312960. Its totient is φ = 55836696875520.
The previous prime is 105011060606071. The next prime is 105011060606131. The reversal of 105011060606085 is 580606060110501.
It is not a de Polignac number, because 105011060606085 - 26 = 105011060606021 is a prime.
It is a super-2 number, since 2×1050110606060852 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10575127020 + ... + 10575136949.
It is an arithmetic number, because the mean of its divisors is an integer number (10532831457060).
Almost surely, 2105011060606085 is an apocalyptic number.
105011060606085 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
105011060606085 is a deficient number, since it is larger than the sum of its proper divisors (63514242706875).
105011060606085 is a wasteful number, since it uses less digits than its factorization.
105011060606085 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21150264308.
The product of its (nonzero) digits is 43200, while the sum is 39.
The spelling of 105011060606085 in words is "one hundred five trillion, eleven billion, sixty million, six hundred six thousand, eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •