Base | Representation |
---|---|
bin | 10110010001101111101110… |
… | …10011001111010000001011 |
3 | 20102110020020102222010212001 |
4 | 23020313313103033100023 |
5 | 22410110414230321233 |
6 | 252104520345331431 |
7 | 13214166346143631 |
oct | 1310676723172013 |
9 | 212406212863761 |
10 | 48988251026443 |
11 | 146778896464a3 |
12 | 55b2302196b77 |
13 | 21447593045a1 |
14 | c15088a49351 |
15 | 59e46bc1127d |
hex | 2c8df74cf40b |
48988251026443 has 4 divisors (see below), whose sum is σ = 49147821877000. Its totient is φ = 48828680175888.
The previous prime is 48988251026423. The next prime is 48988251026483. The reversal of 48988251026443 is 34462015288984.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-48988251026443 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (48988251026413) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 79785424818 + ... + 79785425431.
It is an arithmetic number, because the mean of its divisors is an integer number (12286955469250).
Almost surely, 248988251026443 is an apocalyptic number.
48988251026443 is a deficient number, since it is larger than the sum of its proper divisors (159570850557).
48988251026443 is a wasteful number, since it uses less digits than its factorization.
48988251026443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159570850556.
The product of its (nonzero) digits is 106168320, while the sum is 64.
It can be divided in two parts, 489882 and 51026443, that added together give a triangular number (51516325 = T10150).
The spelling of 48988251026443 in words is "forty-eight trillion, nine hundred eighty-eight billion, two hundred fifty-one million, twenty-six thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •