Base | Representation |
---|---|
bin | 110000110010101001… |
… | …0011100110011011000 |
3 | 101000110012022212012010 |
4 | 1201211102130303120 |
5 | 3204041302103423 |
6 | 120045023545520 |
7 | 10366336661403 |
oct | 1414522346330 |
9 | 330405285163 |
10 | 104778550488 |
11 | 4048883a887 |
12 | 1838215b2a0 |
13 | 9b5a813c01 |
14 | 50dd958d3a |
15 | 2ad39eb693 |
hex | 186549ccd8 |
104778550488 has 64 divisors (see below), whose sum is σ = 277040073600. Its totient is φ = 32931118080.
The previous prime is 104778550483. The next prime is 104778550489. The reversal of 104778550488 is 884055877401.
It is a hoax number, since the sum of its digits (57) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104778550483) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 448281 + ... + 640712.
It is an arithmetic number, because the mean of its divisors is an integer number (4328751150).
Almost surely, 2104778550488 is an apocalyptic number.
It is an amenable number.
104778550488 is an abundant number, since it is smaller than the sum of its proper divisors (172261523112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104778550488 is a wasteful number, since it uses less digits than its factorization.
104778550488 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1089232 (or 1089228 counting only the distinct ones).
The product of its (nonzero) digits is 10035200, while the sum is 57.
The spelling of 104778550488 in words is "one hundred four billion, seven hundred seventy-eight million, five hundred fifty thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •