Base | Representation |
---|---|
bin | 1011011100101… |
… | …1101000000000 |
3 | 10100100200000100 |
4 | 2313023220000 |
5 | 44243114333 |
6 | 4433122400 |
7 | 1122106623 |
oct | 267135000 |
9 | 110320010 |
10 | 48019968 |
11 | 25119127 |
12 | 140b9400 |
13 | 9c440a9 |
14 | 653ddba |
15 | 4338213 |
hex | 2dcba00 |
48019968 has 120 divisors (see below), whose sum is σ = 146980548. Its totient is φ = 15040512.
The previous prime is 48019967. The next prime is 48019981. The reversal of 48019968 is 86991084.
It can be written as a sum of positive squares in 2 ways, for example, as 45805824 + 2214144 = 6768^2 + 1488^2 .
It is not an unprimeable number, because it can be changed into a prime (48019967) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 78030 + ... + 78642.
Almost surely, 248019968 is an apocalyptic number.
48019968 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 48019968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (73490274).
48019968 is an abundant number, since it is smaller than the sum of its proper divisors (98960580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48019968 is a wasteful number, since it uses less digits than its factorization.
48019968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 654 (or 635 counting only the distinct ones).
The product of its (nonzero) digits is 124416, while the sum is 45.
The square root of 48019968 is about 6929.6441467077. The cubic root of 48019968 is about 363.4745063911.
The spelling of 48019968 in words is "forty-eight million, nineteen thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •