Base | Representation |
---|---|
bin | 11000111100100110101000… |
… | …101000111110100100000001 |
3 | 112101110220201221220220221011 |
4 | 120330212220220332210001 |
5 | 103340103442314000000 |
6 | 1025203351443400521 |
7 | 32052563410623100 |
oct | 3074465050764401 |
9 | 471426657826834 |
10 | 109717768890625 |
11 | 31a61054225475 |
12 | 10380056983141 |
13 | 492b458845c1c |
14 | 1d14522a6a037 |
15 | ca4026eaa2ba |
hex | 63c9a8a3e901 |
109717768890625 has 63 divisors (see below), whose sum is σ = 159549878458071. Its totient is φ = 75228756750000.
The previous prime is 109717768890617. The next prime is 109717768890731. The reversal of 109717768890625 is 526098867717901.
The square root of 109717768890625 is 10474625.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 3 ways, for example, as 96123298454001 + 13594470436624 = 9804249^2 + 3687068^2 .
It is not a de Polignac number, because 109717768890625 - 23 = 109717768890617 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 62 ways as a sum of consecutive naturals, for example, 9165290890 + ... + 9165302860.
Almost surely, 2109717768890625 is an apocalyptic number.
109717768890625 is the 10474625-th square number.
109717768890625 is the 5237313-rd centered octagonal number.
It is an amenable number.
109717768890625 is a deficient number, since it is larger than the sum of its proper divisors (49832109567446).
109717768890625 is an frugal number, since it uses more digits than its factorization.
109717768890625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23986 (or 11983 counting only the distinct ones).
The product of its (nonzero) digits is 640120320, while the sum is 76.
The spelling of 109717768890625 in words is "one hundred nine trillion, seven hundred seventeen billion, seven hundred sixty-eight million, eight hundred ninety thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •