Base | Representation |
---|---|
bin | 10110000100101110001010… |
… | …01100001000100110001000 |
3 | 20100212110010012011201101122 |
4 | 23002113011030020212020 |
5 | 22330242410312021314 |
6 | 251123145532134412 |
7 | 13136644426522562 |
oct | 1302270514104610 |
9 | 210773105151348 |
10 | 48540733704584 |
11 | 145150117a3970 |
12 | 553b629607408 |
13 | 21114aa39c564 |
14 | bdb553b78332 |
15 | 5929c88cb28e |
hex | 2c25c5308988 |
48540733704584 has 64 divisors (see below), whose sum is σ = 109057608576000. Its totient is φ = 19993894873920.
The previous prime is 48540733704539. The next prime is 48540733704599.
48540733704584 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×485407337045842 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 631081964 + ... + 631158875.
It is an arithmetic number, because the mean of its divisors is an integer number (1704025134000).
Almost surely, 248540733704584 is an apocalyptic number.
48540733704584 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
48540733704584 is an abundant number, since it is smaller than the sum of its proper divisors (60516874871416).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48540733704584 is a wasteful number, since it uses less digits than its factorization.
48540733704584 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1262240898 (or 1262240894 counting only the distinct ones).
The product of its (nonzero) digits is 180633600, while the sum is 62.
The spelling of 48540733704584 in words is "forty-eight trillion, five hundred forty billion, seven hundred thirty-three million, seven hundred four thousand, five hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •