Base | Representation |
---|---|
bin | 1100100001100… |
… | …00001101011001 |
3 | 21022200100110100 |
4 | 12100300031121 |
5 | 203343230230 |
6 | 14231410013 |
7 | 2413644663 |
oct | 620601531 |
9 | 238610410 |
10 | 105055065 |
11 | 54334475 |
12 | 2b223909 |
13 | 189c367b |
14 | dd49533 |
15 | 9352660 |
hex | 6430359 |
105055065 has 12 divisors (see below), whose sum is σ = 182095524. Its totient is φ = 56029344.
The previous prime is 105055051. The next prime is 105055109. The reversal of 105055065 is 560550501.
105055065 is a `hidden beast` number, since 1 + 0 + 50 + 550 + 65 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 22099401 + 82955664 = 4701^2 + 9108^2 .
It is not a de Polignac number, because 105055065 - 28 = 105054809 is a prime.
It is a super-2 number, since 2×1050550652 = 22073133364308450, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1167234 + ... + 1167323.
It is an arithmetic number, because the mean of its divisors is an integer number (15174627).
Almost surely, 2105055065 is an apocalyptic number.
105055065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
105055065 is a deficient number, since it is larger than the sum of its proper divisors (77040459).
105055065 is a wasteful number, since it uses less digits than its factorization.
105055065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2334568 (or 2334565 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The square root of 105055065 is about 10249.6373106564. The cubic root of 105055065 is about 471.8518534032.
The spelling of 105055065 in words is "one hundred five million, fifty-five thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •