Base | Representation |
---|---|
bin | 10111101001011100101000… |
… | …111101100110100100011000 |
3 | 111122020121202012202110022210 |
4 | 113221130220331212210120 |
5 | 102112442244444410130 |
6 | 1005110244334315120 |
7 | 30622664142260514 |
oct | 2751345075464430 |
9 | 448217665673283 |
10 | 104003320310040 |
11 | 30158618a54928 |
12 | b7b8659658aa0 |
13 | 4605617ab5278 |
14 | 1b97b050d7144 |
15 | c05571ee05b0 |
hex | 5e9728f66918 |
104003320310040 has 128 divisors (see below), whose sum is σ = 320457618524160. Its totient is φ = 26983385823744.
The previous prime is 104003320310023. The next prime is 104003320310081. The reversal of 104003320310040 is 40013023300401.
It is a junction number, because it is equal to n+sod(n) for n = 104003320309989 and 104003320310016.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 96536017 + ... + 97607423.
It is an arithmetic number, because the mean of its divisors is an integer number (2503575144720).
Almost surely, 2104003320310040 is an apocalyptic number.
104003320310040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
104003320310040 is an abundant number, since it is smaller than the sum of its proper divisors (216454298214120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104003320310040 is a wasteful number, since it uses less digits than its factorization.
104003320310040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1093321 (or 1093317 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 104003320310040 its reverse (40013023300401), we get a palindrome (144016343610441).
The spelling of 104003320310040 in words is "one hundred four trillion, three billion, three hundred twenty million, three hundred ten thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •