Base | Representation |
---|---|
bin | 110000011100110000… |
… | …0011110100001011000 |
3 | 100221120000012100120002 |
4 | 1200321200132201120 |
5 | 3201040232430130 |
6 | 115444104352132 |
7 | 10342210443356 |
oct | 1407140364130 |
9 | 327500170502 |
10 | 104044030040 |
11 | 40141162795 |
12 | 181b8175648 |
13 | 9a715a9122 |
14 | 50701967d6 |
15 | 2a8e2aab45 |
hex | 183981e858 |
104044030040 has 32 divisors (see below), whose sum is σ = 244277290080. Its totient is φ = 39808150272.
The previous prime is 104044030021. The next prime is 104044030043. The reversal of 104044030040 is 40030440401.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 104044029994 and 104044030021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104044030043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56544749 + ... + 56546588.
It is an arithmetic number, because the mean of its divisors is an integer number (7633665315).
Almost surely, 2104044030040 is an apocalyptic number.
104044030040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
104044030040 is an abundant number, since it is smaller than the sum of its proper divisors (140233260040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104044030040 is a wasteful number, since it uses less digits than its factorization.
104044030040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113091371 (or 113091367 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 20.
Adding to 104044030040 its reverse (40030440401), we get a palindrome (144074470441).
The spelling of 104044030040 in words is "one hundred four billion, forty-four million, thirty thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •