Base | Representation |
---|---|
bin | 110000011010010001… |
… | …0100111010010000000 |
3 | 100221100012101221220012 |
4 | 1200310202213102000 |
5 | 3200402420013003 |
6 | 115431530404052 |
7 | 10340146255601 |
oct | 1406442472200 |
9 | 327305357805 |
10 | 103960704128 |
11 | 400a911a7a6 |
12 | 18194290628 |
13 | 9a5a252c58 |
14 | 50630a5da8 |
15 | 2a86ceb8d8 |
hex | 18348a7480 |
103960704128 has 24 divisors (see below), whose sum is σ = 207116482755. Its totient is φ = 51978528128.
The previous prime is 103960704119. The next prime is 103960704139. The reversal of 103960704128 is 821407069301.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
103960704128 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 51980352064 + 51980352064 = 227992^2 + 227992^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=227992.
It is a Duffinian number.
It is an unprimeable number.
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 2 ways as a sum of consecutive naturals, for example, 3633623 + ... + 3662121.
Almost surely, 2103960704128 is an apocalyptic number.
It is an amenable number.
103960704128 is a deficient number, since it is larger than the sum of its proper divisors (103155778627).
103960704128 is an frugal number, since it uses more digits than its factorization.
103960704128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57012 (or 28501 counting only the distinct ones).
The product of its (nonzero) digits is 72576, while the sum is 41.
The spelling of 103960704128 in words is "one hundred three billion, nine hundred sixty million, seven hundred four thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •