Base | Representation |
---|---|
bin | 110000101100011100… |
… | …1101110110001000100 |
3 | 100222220201022012002221 |
4 | 1201120321232301010 |
5 | 3203130102301001 |
6 | 120012241542124 |
7 | 10361234441254 |
oct | 1413071566104 |
9 | 328821265087 |
10 | 104570743876 |
11 | 40391505685 |
12 | 18324644944 |
13 | 9b26755511 |
14 | 50c0103964 |
15 | 2ac064e1a1 |
hex | 1858e6ec44 |
104570743876 has 27 divisors (see below), whose sum is σ = 194417092317. Its totient is φ = 49204587840.
The previous prime is 104570743853. The next prime is 104570743889. The reversal of 104570743876 is 678347075401.
The square root of 104570743876 is 323374.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 81413208900 + 23157534976 = 285330^2 + 152176^2 .
It is a Smith number, since the sum of its digits (52) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is an unprimeable number.
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 8 ways as a sum of consecutive naturals, for example, 10989961 + ... + 10999471.
Almost surely, 2104570743876 is an apocalyptic number.
104570743876 is the 323374-th square number.
It is an amenable number.
104570743876 is a deficient number, since it is larger than the sum of its proper divisors (89846348441).
104570743876 is an frugal number, since it uses more digits than its factorization.
104570743876 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19060 (or 9530 counting only the distinct ones).
The product of its (nonzero) digits is 3951360, while the sum is 52.
It can be divided in two parts, 1045 and 70743876, that added together give a square (70744921 = 84112).
The spelling of 104570743876 in words is "one hundred four billion, five hundred seventy million, seven hundred forty-three thousand, eight hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •