Base | Representation |
---|---|
bin | 101101010111110111… |
… | …010010110100000010 |
3 | 11122202021221002012020 |
4 | 231113313102310002 |
5 | 1244234000044101 |
6 | 34214151542310 |
7 | 3343203365556 |
oct | 552767226402 |
9 | 148667832166 |
10 | 48718753026 |
11 | 19730514259 |
12 | 953798a996 |
13 | 479549c718 |
14 | 25024d1866 |
15 | 140215b136 |
hex | b57dd2d02 |
48718753026 has 8 divisors (see below), whose sum is σ = 97437506064. Its totient is φ = 16239584340.
The previous prime is 48718753007. The next prime is 48718753037. The reversal of 48718753026 is 62035781784.
It is a sphenic number, since it is the product of 3 distinct primes.
48718753026 is an admirable number.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 48718753026.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4059896080 + ... + 4059896091.
It is an arithmetic number, because the mean of its divisors is an integer number (12179688258).
Almost surely, 248718753026 is an apocalyptic number.
48718753026 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.
48718753026 is a wasteful number, since it uses less digits than its factorization.
48718753026 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8119792176.
The product of its (nonzero) digits is 2257920, while the sum is 51.
The spelling of 48718753026 in words is "forty-eight billion, seven hundred eighteen million, seven hundred fifty-three thousand, twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •