Base | Representation |
---|---|
bin | 10100001010011110101110… |
… | …111001101110000101001000 |
3 | 102121222211111000110010101120 |
4 | 110022132232321232011020 |
5 | 43110422420234031143 |
6 | 512335313534315240 |
7 | 24451666632520545 |
oct | 2412365671560510 |
9 | 377884430403346 |
10 | 88681124127048 |
11 | 262904a9726272 |
12 | 9b42bb5058b20 |
13 | 3a637953960cb |
14 | 17c8291671bcc |
15 | a3bbed73a383 |
hex | 50a7aee6e148 |
88681124127048 has 32 divisors (see below), whose sum is σ = 223395198190560. Its totient is φ = 29334722992640.
The previous prime is 88681124127019. The next prime is 88681124127049. The reversal of 88681124127048 is 84072142118688.
It is a junction number, because it is equal to n+sod(n) for n = 88681124126982 and 88681124127000.
It is not an unprimeable number, because it can be changed into a prime (88681124127049) by changing a digit.
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, 14103229065 + ... + 14103235352.
It is an arithmetic number, because the mean of its divisors is an integer number (6981099943455).
Almost surely, 288681124127048 is an apocalyptic number.
It is an amenable number.
88681124127048 is an abundant number, since it is smaller than the sum of its proper divisors (134714074063512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
88681124127048 is a wasteful number, since it uses less digits than its factorization.
88681124127048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28206464557 (or 28206464553 counting only the distinct ones).
The product of its (nonzero) digits is 11010048, while the sum is 60.
The spelling of 88681124127048 in words is "eighty-eight trillion, six hundred eighty-one billion, one hundred twenty-four million, one hundred twenty-seven thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •