Base | Representation |
---|---|
bin | 1011100001001… |
… | …1111111101000 |
3 | 10100220201122000 |
4 | 2320103333220 |
5 | 44332111032 |
6 | 4443331000 |
7 | 1124453055 |
oct | 270237750 |
9 | 110821560 |
10 | 48316392 |
11 | 25300903 |
12 | 14220a60 |
13 | a018ca7 |
14 | 65ba02c |
15 | 4395e7c |
hex | 2e13fe8 |
48316392 has 128 divisors (see below), whose sum is σ = 144336000. Its totient is φ = 14929920.
The previous prime is 48316381. The next prime is 48316421. The reversal of 48316392 is 29361384.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a nude number because it is divisible by every one of its digits.
Its product of digits (31104) is a multiple of the sum of its prime factors (288).
It is a nialpdrome in base 6.
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, 250248 + ... + 250440.
It is an arithmetic number, because the mean of its divisors is an integer number (1127625).
Almost surely, 248316392 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 48316392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72168000).
48316392 is an abundant number, since it is smaller than the sum of its proper divisors (96019608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48316392 is a wasteful number, since it uses less digits than its factorization.
48316392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 288 (or 278 counting only the distinct ones).
The product of its digits is 31104, while the sum is 36.
The square root of 48316392 is about 6950.9993526111. Note that the first 3 decimals coincide. The cubic root of 48316392 is about 364.2208738772.
The spelling of 48316392 in words is "forty-eight million, three hundred sixteen thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •