Base | Representation |
---|---|
bin | 1100011100001… |
… | …01111010011000 |
3 | 21021100220121122 |
4 | 12032011322120 |
5 | 203203420103 |
6 | 14204424412 |
7 | 2405011232 |
oct | 616057230 |
9 | 237326548 |
10 | 104357528 |
11 | 539a83a0 |
12 | 2ab48108 |
13 | 1880b022 |
14 | dc07252 |
15 | 9265b38 |
hex | 6385e98 |
104357528 has 32 divisors (see below), whose sum is σ = 215472960. Its totient is φ = 46987680.
The previous prime is 104357527. The next prime is 104357593. The reversal of 104357528 is 825753401.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104357521) 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 7 ways as a sum of consecutive naturals, for example, 3875 + ... + 14957.
It is an arithmetic number, because the mean of its divisors is an integer number (6733530).
Almost surely, 2104357528 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 104357528, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107736480).
104357528 is an abundant number, since it is smaller than the sum of its proper divisors (111115432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104357528 is a wasteful number, since it uses less digits than its factorization.
104357528 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11207 (or 11203 counting only the distinct ones).
The product of its (nonzero) digits is 33600, while the sum is 35.
The square root of 104357528 is about 10215.5532400355. The cubic root of 104357528 is about 470.8052109307.
The spelling of 104357528 in words is "one hundred four million, three hundred fifty-seven thousand, five hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •