Base | Representation |
---|---|
bin | 1100011110111… |
… | …00000100100101 |
3 | 21022000211201100 |
4 | 12033130010211 |
5 | 203301213222 |
6 | 14220150313 |
7 | 2411011146 |
oct | 617340445 |
9 | 238024640 |
10 | 104710437 |
11 | 54119557 |
12 | 2b098399 |
13 | 18902850 |
14 | dc99acd |
15 | 92d54ac |
hex | 63dc125 |
104710437 has 24 divisors (see below), whose sum is σ = 164514168. Its totient is φ = 63792000.
The previous prime is 104710409. The next prime is 104710439. The reversal of 104710437 is 734017401.
It can be written as a sum of positive squares in 4 ways, for example, as 57017601 + 47692836 = 7551^2 + 6906^2 .
It is not a de Polignac number, because 104710437 - 218 = 104448293 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 104710437.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104710439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7387 + ... + 16247.
It is an arithmetic number, because the mean of its divisors is an integer number (6854757).
Almost surely, 2104710437 is an apocalyptic number.
It is an amenable number.
104710437 is a deficient number, since it is larger than the sum of its proper divisors (59803731).
104710437 is a wasteful number, since it uses less digits than its factorization.
104710437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8981 (or 8978 counting only the distinct ones).
The product of its (nonzero) digits is 2352, while the sum is 27.
The square root of 104710437 is about 10232.8117836692. The cubic root of 104710437 is about 471.3353258711.
Adding to 104710437 its reverse (734017401), we get a palindrome (838727838).
The spelling of 104710437 in words is "one hundred four million, seven hundred ten thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •