Base | Representation |
---|---|
bin | 11000000001000010000111… |
… | …010001000000010010110101 |
3 | 111211222120021111022221100012 |
4 | 120001002013101000102311 |
5 | 102321021131403000140 |
6 | 1012351013302030005 |
7 | 31151042535012053 |
oct | 3001020721002265 |
9 | 454876244287305 |
10 | 105624105125045 |
11 | 30722a27801481 |
12 | ba1a7ab118305 |
13 | 46c2405b801c0 |
14 | 1c1233c0011d3 |
15 | c327d31b8265 |
hex | 6010874404b5 |
105624105125045 has 32 divisors (see below), whose sum is σ = 137218737567744. Its totient is φ = 77588002368000.
The previous prime is 105624105125039. The next prime is 105624105125047. The reversal of 105624105125045 is 540521501426501.
It is not a de Polignac number, because 105624105125045 - 26 = 105624105124981 is a prime.
It is a super-2 number, since 2×1056241051250452 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 105624105124993 and 105624105125011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105624105125047) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 356447945 + ... + 356744145.
It is an arithmetic number, because the mean of its divisors is an integer number (4288085548992).
Almost surely, 2105624105125045 is an apocalyptic number.
It is an amenable number.
105624105125045 is a deficient number, since it is larger than the sum of its proper divisors (31594632442699).
105624105125045 is a wasteful number, since it uses less digits than its factorization.
105624105125045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325133.
The product of its (nonzero) digits is 240000, while the sum is 41.
The spelling of 105624105125045 in words is "one hundred five trillion, six hundred twenty-four billion, one hundred five million, one hundred twenty-five thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •