Base | Representation |
---|---|
bin | 10110001100001001011010… |
… | …11101000110001101000000 |
3 | 20101202211201012022221122220 |
4 | 23012010231131012031000 |
5 | 22343432433312132120 |
6 | 251440304240331040 |
7 | 13164246354635052 |
oct | 1306045535061500 |
9 | 211684635287586 |
10 | 48795886052160 |
11 | 14603245630105 |
12 | 5580b77613a80 |
13 | 212c580a2b610 |
14 | c09a3a9878d2 |
15 | 59945dbe1b40 |
hex | 2c612d746340 |
48795886052160 has 112 divisors (see below), whose sum is σ = 166844395044096. Its totient is φ = 12011295025152.
The previous prime is 48795886052131. The next prime is 48795886052161. The reversal of 48795886052160 is 6125068859784.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48795886052161) by changing a digit.
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, 1954950904 + ... + 1954975863.
It is an arithmetic number, because the mean of its divisors is an integer number (1489682098608).
Almost surely, 248795886052160 is an apocalyptic number.
48795886052160 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
48795886052160 is an abundant number, since it is smaller than the sum of its proper divisors (118048508991936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48795886052160 is a wasteful number, since it uses less digits than its factorization.
48795886052160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3909926800 (or 3909926790 counting only the distinct ones).
The product of its (nonzero) digits is 232243200, while the sum is 69.
The spelling of 48795886052160 in words is "forty-eight trillion, seven hundred ninety-five billion, eight hundred eighty-six million, fifty-two thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •