Base | Representation |
---|---|
bin | 11111001110111000111101… |
… | …00011010100010100100000 |
3 | 100000011212112022001000022210 |
4 | 33213130132203110110200 |
5 | 33000233333124330323 |
6 | 402023434115402120 |
7 | 20316030332513352 |
oct | 1747343643242440 |
9 | 300155468030283 |
10 | 68681334605088 |
11 | 1a97a654958527 |
12 | 7852a9bbb3340 |
13 | 2c428118979ba |
14 | 12d62a13630d2 |
15 | 7e185c0cd293 |
hex | 3e771e8d4520 |
68681334605088 has 48 divisors (see below), whose sum is σ = 185161165600320. Its totient is φ = 22275027438336.
The previous prime is 68681334605047. The next prime is 68681334605099. The reversal of 68681334605088 is 88050643318686.
68681334605088 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (48).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9667977108 + ... + 9667984211.
It is an arithmetic number, because the mean of its divisors is an integer number (3857524283340).
Almost surely, 268681334605088 is an apocalyptic number.
It is an amenable number.
68681334605088 is an abundant number, since it is smaller than the sum of its proper divisors (116479830995232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68681334605088 is a wasteful number, since it uses less digits than its factorization.
68681334605088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19335961369 (or 19335961361 counting only the distinct ones).
The product of its (nonzero) digits is 159252480, while the sum is 66.
The spelling of 68681334605088 in words is "sixty-eight trillion, six hundred eighty-one billion, three hundred thirty-four million, six hundred five thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •