Base | Representation |
---|---|
bin | 110000011100101100… |
… | …1101001101000001110 |
3 | 100221112212211102210210 |
4 | 1200321121221220032 |
5 | 3201034303144101 |
6 | 115444002143250 |
7 | 10342156311210 |
oct | 1407131515016 |
9 | 327485742723 |
10 | 104042240526 |
11 | 40140150254 |
12 | 181b7651b26 |
13 | 9a71100743 |
14 | 506dc4c5b0 |
15 | 2a8e0557d6 |
hex | 1839669a0e |
104042240526 has 32 divisors (see below), whose sum is σ = 242297837568. Its totient is φ = 29165479200.
The previous prime is 104042240521. The next prime is 104042240531. The reversal of 104042240526 is 625042240401.
It is an interprime number because it is at equal distance from previous prime (104042240521) and next prime (104042240531).
It is a junction number, because it is equal to n+sod(n) for n = 104042240493 and 104042240502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104042240521) 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, 23367550 + ... + 23372001.
It is an arithmetic number, because the mean of its divisors is an integer number (7571807424).
Almost surely, 2104042240526 is an apocalyptic number.
104042240526 is an abundant number, since it is smaller than the sum of its proper divisors (138255597042).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104042240526 is a wasteful number, since it uses less digits than its factorization.
104042240526 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46739616.
The product of its (nonzero) digits is 15360, while the sum is 30.
Adding to 104042240526 its reverse (625042240401), we get a palindrome (729084480927).
The spelling of 104042240526 in words is "one hundred four billion, forty-two million, two hundred forty thousand, five hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.154 sec. • engine limits •