Base | Representation |
---|---|
bin | 101001010010100001… |
… | …0101000100000100000 |
3 | 22110212110000011021200 |
4 | 1102211002220200200 |
5 | 2423043034324033 |
6 | 104422244521200 |
7 | 6256165626351 |
oct | 1224502504040 |
9 | 273773004250 |
10 | 88668276768 |
11 | 34670a26785 |
12 | 152269b0200 |
13 | 8490c5ab76 |
14 | 44120bdd28 |
15 | 248e4c2013 |
hex | 14a50a8820 |
88668276768 has 72 divisors (see below), whose sum is σ = 254598559488. Its totient is φ = 29269130112.
The previous prime is 88668276757. The next prime is 88668276769. The reversal of 88668276768 is 86767286688.
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a junction number, because it is equal to n+sod(n) for n = 88668276696 and 88668276705.
It is not an unprimeable number, because it can be changed into a prime (88668276769) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1464880 + ... + 1524207.
It is an arithmetic number, because the mean of its divisors is an integer number (3536091104).
Almost surely, 288668276768 is an apocalyptic number.
It is an amenable number.
88668276768 is an abundant number, since it is smaller than the sum of its proper divisors (165930282720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
88668276768 is a wasteful number, since it uses less digits than its factorization.
88668276768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2989206 (or 2989195 counting only the distinct ones).
The product of its digits is 520224768, while the sum is 72.
The spelling of 88668276768 in words is "eighty-eight billion, six hundred sixty-eight million, two hundred seventy-six thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •