Base | Representation |
---|---|
bin | 110000101110000001… |
… | …1000101001000101101 |
3 | 101000001101121211011220 |
4 | 1201130003011020231 |
5 | 3203232110321240 |
6 | 120021405133553 |
7 | 10362445205304 |
oct | 1413403051055 |
9 | 330041554156 |
10 | 104623526445 |
11 | 40409286a39 |
12 | 1833a25a2b9 |
13 | 9b346762c9 |
14 | 50c712343b |
15 | 2ac50c85d0 |
hex | 185c0c522d |
104623526445 has 64 divisors (see below), whose sum is σ = 181909131264. Its totient is φ = 51152675840.
The previous prime is 104623526443. The next prime is 104623526533. The reversal of 104623526445 is 544625326401.
It is a happy number.
It is not a de Polignac number, because 104623526445 - 21 = 104623526443 is a prime.
It is a super-2 number, since 2×1046235264452 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 104623526397 and 104623526406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104623526443) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1467904 + ... + 1537526.
It is an arithmetic number, because the mean of its divisors is an integer number (2842330176).
Almost surely, 2104623526445 is an apocalyptic number.
104623526445 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
104623526445 is a deficient number, since it is larger than the sum of its proper divisors (77285604819).
104623526445 is a wasteful number, since it uses less digits than its factorization.
104623526445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69802.
The product of its (nonzero) digits is 691200, while the sum is 42.
The spelling of 104623526445 in words is "one hundred four billion, six hundred twenty-three million, five hundred twenty-six thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •