Base | Representation |
---|---|
bin | 10110000100101101101100… |
… | …00010111111010011001111 |
3 | 20100212102110111010100121122 |
4 | 23002112312002333103033 |
5 | 22330241400242231400 |
6 | 251123104414551155 |
7 | 13136635223216636 |
oct | 1302266602772317 |
9 | 210772414110548 |
10 | 48540479648975 |
11 | 145149a1350156 |
12 | 553b5785084bb |
13 | 2111469869bb2 |
14 | bdb52c12451d |
15 | 5929b1445685 |
hex | 2c25b60bf4cf |
48540479648975 has 12 divisors (see below), whose sum is σ = 60239410006896. Its totient is φ = 38800631950080.
The previous prime is 48540479648873. The next prime is 48540479648977. The reversal of 48540479648975 is 57984697404584.
It is not a de Polignac number, because 48540479648975 - 28 = 48540479648719 is a prime.
It is a super-2 number, since 2×485404796489752 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 48540479648975.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48540479648977) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 793763042 + ... + 793824191.
It is an arithmetic number, because the mean of its divisors is an integer number (5019950833908).
Almost surely, 248540479648975 is an apocalyptic number.
48540479648975 is a deficient number, since it is larger than the sum of its proper divisors (11698930357921).
48540479648975 is a wasteful number, since it uses less digits than its factorization.
48540479648975 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1587588466 (or 1587588461 counting only the distinct ones).
The product of its (nonzero) digits is 9754214400, while the sum is 80.
The spelling of 48540479648975 in words is "forty-eight trillion, five hundred forty billion, four hundred seventy-nine million, six hundred forty-eight thousand, nine hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •