Base | Representation |
---|---|
bin | 101001010001010011… |
… | …0011100111110000010 |
3 | 22110202120222002210110 |
4 | 1102202212130332002 |
5 | 2423002044210132 |
6 | 104414223212150 |
7 | 6255160626621 |
oct | 1224246347602 |
9 | 273676862713 |
10 | 88627335042 |
11 | 3464a902644 |
12 | 15215147056 |
13 | 84856247ac |
14 | 440a8a36b8 |
15 | 248aad61cc |
hex | 14a299cf82 |
88627335042 has 8 divisors (see below), whose sum is σ = 177254670096. Its totient is φ = 29542445012.
The previous prime is 88627335031. The next prime is 88627335047. The reversal of 88627335042 is 24053372688.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
88627335042 is an admirable number.
It is a super-2 number, since 2×886273350422 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 88627334982 and 88627335000.
It is not an unprimeable number, because it can be changed into a prime (88627335047) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 7385611248 + ... + 7385611259.
It is an arithmetic number, because the mean of its divisors is an integer number (22156833762).
Almost surely, 288627335042 is an apocalyptic number.
88627335042 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
88627335042 is a wasteful number, since it uses less digits than its factorization.
88627335042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14771222512.
The product of its (nonzero) digits is 1935360, while the sum is 48.
The spelling of 88627335042 in words is "eighty-eight billion, six hundred twenty-seven million, three hundred thirty-five thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •