Base | Representation |
---|---|
bin | 1011011110001… |
… | …1111100010000 |
3 | 10100112201122020 |
4 | 2313203330100 |
5 | 44304311233 |
6 | 4435211440 |
7 | 1123003200 |
oct | 267437420 |
9 | 110481566 |
10 | 48119568 |
11 | 25186a42 |
12 | 14146b80 |
13 | 9c7a523 |
14 | 6568400 |
15 | 43579b3 |
hex | 2de3f10 |
48119568 has 120 divisors (see below), whose sum is σ = 148428000. Its totient is φ = 13386240.
The previous prime is 48119557. The next prime is 48119579. The reversal of 48119568 is 86591184.
It is an interprime number because it is at equal distance from previous prime (48119557) and next prime (48119579).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 96183 + ... + 96681.
It is an arithmetic number, because the mean of its divisors is an integer number (1236900).
Almost surely, 248119568 is an apocalyptic number.
48119568 is a gapful number since it is divisible by the number (48) 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 48119568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (74214000).
48119568 is an abundant number, since it is smaller than the sum of its proper divisors (100308432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48119568 is a wasteful number, since it uses less digits than its factorization.
48119568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 565 (or 552 counting only the distinct ones).
The product of its digits is 69120, while the sum is 42.
The square root of 48119568 is about 6936.8269403237. The cubic root of 48119568 is about 363.7256315084.
The spelling of 48119568 in words is "forty-eight million, one hundred nineteen thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •