Base | Representation |
---|---|
bin | 101100101111111000… |
… | …101111100000110000 |
3 | 11121000112212112111011 |
4 | 230233320233200300 |
5 | 1241400244402310 |
6 | 34023432200304 |
7 | 3320450431111 |
oct | 545770574060 |
9 | 147015775434 |
10 | 48048044080 |
11 | 19416960743 |
12 | 938b239094 |
13 | 46b954771a |
14 | 247b3c0208 |
15 | 13b332278a |
hex | b2fe2f830 |
48048044080 has 20 divisors (see below), whose sum is σ = 111711702672. Its totient is φ = 19219217600.
The previous prime is 48048044059. The next prime is 48048044101. The reversal of 48048044080 is 8044084084.
It is an interprime number because it is at equal distance from previous prime (48048044059) and next prime (48048044101).
It is a tau number, because it is divible by the number of its divisors (20).
It is a super-2 number, since 2×480480440802 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (40).
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 3 ways as a sum of consecutive naturals, for example, 300300196 + ... + 300300355.
Almost surely, 248048044080 is an apocalyptic number.
48048044080 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
48048044080 is an abundant number, since it is smaller than the sum of its proper divisors (63663658592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48048044080 is a wasteful number, since it uses less digits than its factorization.
48048044080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 600600564 (or 600600558 counting only the distinct ones).
The product of its (nonzero) digits is 131072, while the sum is 40.
The spelling of 48048044080 in words is "forty-eight billion, forty-eight million, forty-four thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •