Base | Representation |
---|---|
bin | 1011100001011… |
… | …0100001101000 |
3 | 10100221020212000 |
4 | 2320112201220 |
5 | 44332424020 |
6 | 4443451000 |
7 | 1124525226 |
oct | 270264150 |
9 | 110836760 |
10 | 48326760 |
11 | 25308679 |
12 | 14226a60 |
13 | a020921 |
14 | 65bdb16 |
15 | 4399090 |
hex | 2e16868 |
48326760 has 128 divisors (see below), whose sum is σ = 166752000. Its totient is φ = 12434688.
The previous prime is 48326753. The next prime is 48326771. The reversal of 48326760 is 6762384.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 30549 + ... + 32091.
It is an arithmetic number, because the mean of its divisors is an integer number (1302750).
Almost surely, 248326760 is an apocalyptic number.
48326760 is a gapful number since it is divisible by the number (40) 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 48326760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (83376000).
48326760 is an abundant number, since it is smaller than the sum of its proper divisors (118425240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48326760 is a wasteful number, since it uses less digits than its factorization.
48326760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1592 (or 1582 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 36.
The square root of 48326760 is about 6951.7451046482. The cubic root of 48326760 is about 364.2469241939.
The spelling of 48326760 in words is "forty-eight million, three hundred twenty-six thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •