Base | Representation |
---|---|
bin | 110010100111011010… |
… | …1011100010100010000 |
3 | 101101120021020022102221 |
4 | 1211032311130110100 |
5 | 3240102341033424 |
6 | 121533513550424 |
7 | 10565415452611 |
oct | 1451665342420 |
9 | 341507208387 |
10 | 108696814864 |
11 | 42109577900 |
12 | 19096415414 |
13 | a333518241 |
14 | 53920b3c08 |
15 | 2c629c89e4 |
hex | 194ed5c510 |
108696814864 has 135 divisors (see below), whose sum is σ = 237344770551. Its totient is φ = 48187782720.
The previous prime is 108696814859. The next prime is 108696814901. The reversal of 108696814864 is 468418696801.
The square root of 108696814864 is 329692.
It is a perfect power (a square), and thus also a powerful number.
108696814864 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 26 ways as a sum of consecutive naturals, for example, 855880369 + ... + 855880495.
Almost surely, 2108696814864 is an apocalyptic number.
108696814864 is the 329692-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 108696814864
108696814864 is an abundant number, since it is smaller than the sum of its proper divisors (128647955687).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
108696814864 is an equidigital number, since it uses as much as digits as its factorization.
108696814864 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 402 (or 199 counting only the distinct ones).
The product of its (nonzero) digits is 15925248, while the sum is 61.
The spelling of 108696814864 in words is "one hundred eight billion, six hundred ninety-six million, eight hundred fourteen thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •