Base | Representation |
---|---|
bin | 110000110010101001… |
… | …0011000111111101001 |
3 | 101000110012022001210101 |
4 | 1201211102120333221 |
5 | 3204041301104024 |
6 | 120045023345401 |
7 | 10366336565050 |
oct | 1414522307751 |
9 | 330405261711 |
10 | 104778534889 |
11 | 4048882a096 |
12 | 18382152261 |
13 | 9b5a809a92 |
14 | 50dd953397 |
15 | 2ad39e6c44 |
hex | 1865498fe9 |
104778534889 has 24 divisors (see below), whose sum is σ = 128523309120. Its totient is φ = 83641112352.
The previous prime is 104778534881. The next prime is 104778534911. The reversal of 104778534889 is 988435877401.
It is not a de Polignac number, because 104778534889 - 23 = 104778534881 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 104778534889.
It is not an unprimeable number, because it can be changed into a prime (104778534881) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 202294 + ... + 500479.
It is an arithmetic number, because the mean of its divisors is an integer number (5355137880).
Almost surely, 2104778534889 is an apocalyptic number.
104778534889 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
104778534889 is a deficient number, since it is larger than the sum of its proper divisors (23744774231).
104778534889 is an equidigital number, since it uses as much as digits as its factorization.
104778534889 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 702877 (or 702858 counting only the distinct ones).
The product of its (nonzero) digits is 54190080, while the sum is 64.
The spelling of 104778534889 in words is "one hundred four billion, seven hundred seventy-eight million, five hundred thirty-four thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •