Base | Representation |
---|---|
bin | 10110000010111011000110… |
… | …10110100001011001000000 |
3 | 20100122112200021011111010210 |
4 | 23001131203112201121000 |
5 | 22323234403423441042 |
6 | 251034532241354120 |
7 | 13132326614020512 |
oct | 1301354326413100 |
9 | 210575607144123 |
10 | 48478962718272 |
11 | 144a08a3679659 |
12 | 552b66a638940 |
13 | 2108714a70398 |
14 | bd8574001bb2 |
15 | 5910b0951a9c |
hex | 2c17635a1640 |
48478962718272 has 112 divisors (see below), whose sum is σ = 130464777830400. Its totient is φ = 15882899735040.
The previous prime is 48478962718177. The next prime is 48478962718327. The reversal of 48478962718272 is 27281726987484.
It is a junction number, because it is equal to n+sod(n) for n = 48478962718194 and 48478962718203.
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 15 ways as a sum of consecutive naturals, for example, 62952129 + ... + 63717567.
Almost surely, 248478962718272 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 48478962718272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (65232388915200).
48478962718272 is an abundant number, since it is smaller than the sum of its proper divisors (81985815112128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48478962718272 is a wasteful number, since it uses less digits than its factorization.
48478962718272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 771104 (or 771094 counting only the distinct ones).
The product of its digits is 1213857792, while the sum is 75.
The spelling of 48478962718272 in words is "forty-eight trillion, four hundred seventy-eight billion, nine hundred sixty-two million, seven hundred eighteen thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •