Base | Representation |
---|---|
bin | 101101000011011110… |
… | …100100100011010000 |
3 | 11121212110100101201210 |
4 | 231003132210203100 |
5 | 1243033420242020 |
6 | 34120213100120 |
7 | 3331551254424 |
oct | 550336444320 |
9 | 147773311653 |
10 | 48376727760 |
11 | 19575446649 |
12 | 9461327640 |
13 | 473c6792ca |
14 | 24accdcb84 |
15 | 13d20ea3e0 |
hex | b437a48d0 |
48376727760 has 160 divisors (see below), whose sum is σ = 153306616320. Its totient is φ = 12613791744.
The previous prime is 48376727743. The next prime is 48376727821. The reversal of 48376727760 is 6772767384.
It is a self number, because there is not a number n which added to its sum of digits gives 48376727760.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 23156796 + ... + 23158884.
It is an arithmetic number, because the mean of its divisors is an integer number (958166352).
Almost surely, 248376727760 is an apocalyptic number.
48376727760 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 48376727760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (76653308160).
48376727760 is an abundant number, since it is smaller than the sum of its proper divisors (104929888560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48376727760 is a wasteful number, since it uses less digits than its factorization.
48376727760 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4205 (or 4199 counting only the distinct ones).
The product of its (nonzero) digits is 16595712, while the sum is 57.
The spelling of 48376727760 in words is "forty-eight billion, three hundred seventy-six million, seven hundred twenty-seven thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •