Base | Representation |
---|---|
bin | 1100100001100… |
… | …01000111011110 |
3 | 21022200112120000 |
4 | 12100301013132 |
5 | 203343340112 |
6 | 14231435130 |
7 | 2413661553 |
oct | 620610736 |
9 | 238615500 |
10 | 105058782 |
11 | 54337244 |
12 | 2b225aa6 |
13 | 189c527a |
14 | dd4aa2a |
15 | 93537dc |
hex | 64311de |
105058782 has 40 divisors (see below), whose sum is σ = 238418400. Its totient is φ = 34572096.
The previous prime is 105058727. The next prime is 105058787. The reversal of 105058782 is 287850501.
It is a super-2 number, since 2×1050587822 = 22074695350647048, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105058787) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 8694 + ... + 16902.
It is an arithmetic number, because the mean of its divisors is an integer number (5960460).
Almost surely, 2105058782 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 105058782, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (119209200).
105058782 is an abundant number, since it is smaller than the sum of its proper divisors (133359618).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105058782 is an equidigital number, since it uses as much as digits as its factorization.
105058782 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8302 (or 8293 counting only the distinct ones).
The product of its (nonzero) digits is 22400, while the sum is 36.
The square root of 105058782 is about 10249.8186325417. The cubic root of 105058782 is about 471.8574182710.
The spelling of 105058782 in words is "one hundred five million, fifty-eight thousand, seven hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •