Base | Representation |
---|---|
bin | 1100100101011… |
… | …01000101000100 |
3 | 21100122100001120 |
4 | 12102231011010 |
5 | 204011112112 |
6 | 14250353540 |
7 | 2421205101 |
oct | 622550504 |
9 | 240570046 |
10 | 105566532 |
11 | 54653775 |
12 | 2b42b8b0 |
13 | 18b42406 |
14 | 1003daa8 |
15 | 9403e8c |
hex | 64ad144 |
105566532 has 48 divisors (see below), whose sum is σ = 269240832. Its totient is φ = 32048640.
The previous prime is 105566519. The next prime is 105566533. The reversal of 105566532 is 235665501.
It is a super-2 number, since 2×1055665322 = 22288585357014048, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105566493 and 105566502.
It is not an unprimeable number, because it can be changed into a prime (105566533) 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 15 ways as a sum of consecutive naturals, for example, 2023 + ... + 14670.
It is an arithmetic number, because the mean of its divisors is an integer number (5609184).
Almost surely, 2105566532 is an apocalyptic number.
105566532 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
105566532 is an abundant number, since it is smaller than the sum of its proper divisors (163674300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105566532 is a wasteful number, since it uses less digits than its factorization.
105566532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16748 (or 16746 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 33.
The square root of 105566532 is about 10274.5575087203. The cubic root of 105566532 is about 472.6163605808.
The spelling of 105566532 in words is "one hundred five million, five hundred sixty-six thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •