Base | Representation |
---|---|
bin | 1100100101110… |
… | …01001100000100 |
3 | 21100201212002121 |
4 | 12102321030010 |
5 | 204014204012 |
6 | 14251415324 |
7 | 2421502516 |
oct | 622711404 |
9 | 240655077 |
10 | 105616132 |
11 | 54687a66 |
12 | 2b454544 |
13 | 18b5bb6b |
14 | 10053bb6 |
15 | 9413a07 |
hex | 64b9304 |
105616132 has 24 divisors (see below), whose sum is σ = 193932032. Its totient is φ = 50263200.
The previous prime is 105616111. The next prime is 105616139. The reversal of 105616132 is 231616501.
It is a super-2 number, since 2×1056161322 = 22309534677282848, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105616097 and 105616106.
It is not an unprimeable number, because it can be changed into a prime (105616139) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 583 + ... + 14545.
Almost surely, 2105616132 is an apocalyptic number.
It is an amenable number.
105616132 is a deficient number, since it is larger than the sum of its proper divisors (88315900).
105616132 is a wasteful number, since it uses less digits than its factorization.
105616132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14059 (or 14057 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 25.
The square root of 105616132 is about 10276.9709545177. The cubic root of 105616132 is about 472.6903679411.
The spelling of 105616132 in words is "one hundred five million, six hundred sixteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •