Base | Representation |
---|---|
bin | 1011100100100… |
… | …0011001101110 |
3 | 10101022122002110 |
4 | 2321020121232 |
5 | 44410443204 |
6 | 4452104450 |
7 | 1126335645 |
oct | 271103156 |
9 | 111278073 |
10 | 48531054 |
11 | 25438110 |
12 | 14305126 |
13 | a092900 |
14 | 663435c |
15 | 43d9889 |
hex | 2e4866e |
48531054 has 96 divisors (see below), whose sum is σ = 121219200. Its totient is φ = 12804480.
The previous prime is 48531029. The next prime is 48531059. The reversal of 48531054 is 45013584.
48531054 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48531059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 211812 + ... + 212040.
It is an arithmetic number, because the mean of its divisors is an integer number (1262700).
Almost surely, 248531054 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 48531054, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (60609600).
48531054 is an abundant number, since it is smaller than the sum of its proper divisors (72688146).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48531054 is a wasteful number, since it uses less digits than its factorization.
48531054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 290 (or 277 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 30.
The square root of 48531054 is about 6966.4233290836. The cubic root of 48531054 is about 364.7594687243.
The spelling of 48531054 in words is "forty-eight million, five hundred thirty-one thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •