Base | Representation |
---|---|
bin | 11000001111010011010100… |
… | …100000010001001101101001 |
3 | 111222110022020121010020000201 |
4 | 120033103110200101031221 |
5 | 102433102312300000000 |
6 | 1014421300213032201 |
7 | 31311634456553416 |
oct | 3017232440211551 |
9 | 458408217106021 |
10 | 106604653515625 |
11 | 30a70863806301 |
12 | bb58842925661 |
13 | 4763a11269b85 |
14 | 1c4799ad1310d |
15 | c4d071dd996a |
hex | 60f4d4811369 |
106604653515625 has 18 divisors (see below), whose sum is σ = 133255749155834. Its totient is φ = 85283722500000.
The previous prime is 106604653515623. The next prime is 106604653515671. The reversal of 106604653515625 is 526515356406601.
It can be written as a sum of positive squares in 9 ways, for example, as 34871528764944 + 71733124750681 = 5905212^2 + 8469541^2 .
It is not a de Polignac number, because 106604653515625 - 21 = 106604653515623 is a prime.
It is a super-3 number, since 3×1066046535156253 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106604653515623) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 136063332 + ... + 136844581.
Almost surely, 2106604653515625 is an apocalyptic number.
It is an amenable number.
106604653515625 is a deficient number, since it is larger than the sum of its proper divisors (26651095640209).
106604653515625 is an frugal number, since it uses more digits than its factorization.
106604653515625 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 272907953 (or 272907918 counting only the distinct ones).
The product of its (nonzero) digits is 19440000, while the sum is 55.
The spelling of 106604653515625 in words is "one hundred six trillion, six hundred four billion, six hundred fifty-three million, five hundred fifteen thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •