Base | Representation |
---|---|
bin | 110000010111011110… |
… | …1000100100110010000 |
3 | 100221002200001002222100 |
4 | 1200232331010212100 |
5 | 3200204421223111 |
6 | 115414341440400 |
7 | 10334630506632 |
oct | 1405675044620 |
9 | 327080032870 |
10 | 103866976656 |
11 | 40060222983 |
12 | 18168a10100 |
13 | 9a439c7501 |
14 | 5054868a52 |
15 | 2a7d985756 |
hex | 182ef44990 |
103866976656 has 135 divisors (see below), whose sum is σ = 294599013163. Its totient is φ = 34162104000.
The previous prime is 103866976621. The next prime is 103866976667. The reversal of 103866976656 is 656679668301.
It is a happy number.
The square root of 103866976656 is 322284.
It is a perfect power (a square), and thus also a powerful number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103866976593 and 103866976602.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 413812531 + ... + 413812781.
Almost surely, 2103866976656 is an apocalyptic number.
103866976656 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
103866976656 is the 322284-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 103866976656
103866976656 is an abundant number, since it is smaller than the sum of its proper divisors (190732036507).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103866976656 is an equidigital number, since it uses as much as digits as its factorization.
103866976656 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 730 (or 363 counting only the distinct ones).
The product of its (nonzero) digits is 58786560, while the sum is 63.
The spelling of 103866976656 in words is "one hundred three billion, eight hundred sixty-six million, nine hundred seventy-six thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •