Base | Representation |
---|---|
bin | 10101111111100101110010… |
… | …00100100101101000101001 |
3 | 20100020121001202100000122212 |
4 | 22333302321010211220221 |
5 | 22314400331301200044 |
6 | 250510152052254505 |
7 | 13121133554203151 |
oct | 1277627104455051 |
9 | 210217052300585 |
10 | 48364436740649 |
11 | 14457273755577 |
12 | 5511428011435 |
13 | 20ca9929a2813 |
14 | bd2bcbaad761 |
15 | 58d10b338a9e |
hex | 2bfcb9125a29 |
48364436740649 has 8 divisors (see below), whose sum is σ = 51209465260680. Its totient is φ = 45519415070976.
The previous prime is 48364436740643. The next prime is 48364436740651. The reversal of 48364436740649 is 94604763446384.
It can be written as a sum of positive squares in 4 ways, for example, as 21884479267225 + 26479957473424 = 4678085^2 + 5145868^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-48364436740649 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (48364436740643) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23067227 + ... + 25076399.
It is an arithmetic number, because the mean of its divisors is an integer number (6401183157585).
Almost surely, 248364436740649 is an apocalyptic number.
It is an amenable number.
48364436740649 is a deficient number, since it is larger than the sum of its proper divisors (2845028520031).
48364436740649 is a wasteful number, since it uses less digits than its factorization.
48364436740649 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3425179.
The product of its (nonzero) digits is 1003290624, while the sum is 68.
The spelling of 48364436740649 in words is "forty-eight trillion, three hundred sixty-four billion, four hundred thirty-six million, seven hundred forty thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •