Base | Representation |
---|---|
bin | 1100011111011… |
… | …11101000000000 |
3 | 21022011220120200 |
4 | 12033233220000 |
5 | 203311244103 |
6 | 14222005200 |
7 | 2411463513 |
oct | 617575000 |
9 | 238156520 |
10 | 104790528 |
11 | 54173747 |
12 | 2b116800 |
13 | 1893013b |
14 | dcbad7a |
15 | 92ee0a3 |
hex | 63efa00 |
104790528 has 60 divisors (see below), whose sum is σ = 302445858. Its totient is φ = 34928640.
The previous prime is 104790503. The next prime is 104790541. The reversal of 104790528 is 825097401.
104790528 is a `hidden beast` number, since 1 + 0 + 47 + 90 + 528 = 666.
It can be written as a sum of positive squares in only one way, i.e., 102576384 + 2214144 = 10128^2 + 1488^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 104790492 and 104790501.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 6763 + ... + 15978.
Almost surely, 2104790528 is an apocalyptic number.
104790528 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
104790528 is an abundant number, since it is smaller than the sum of its proper divisors (197655330).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104790528 is an equidigital number, since it uses as much as digits as its factorization.
104790528 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22765 (or 22746 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 36.
The square root of 104790528 is about 10236.7244761203. The cubic root of 104790528 is about 471.4554670212.
The spelling of 104790528 in words is "one hundred four million, seven hundred ninety thousand, five hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •