Base | Representation |
---|---|
bin | 1011100000011… |
… | …0111001110010 |
3 | 10100211000002000 |
4 | 2320012321302 |
5 | 44323402040 |
6 | 4442234430 |
7 | 1124140533 |
oct | 270067162 |
9 | 110730060 |
10 | 48262770 |
11 | 25274596 |
12 | 141b5a16 |
13 | 9cca76a |
14 | 65a468a |
15 | 4385130 |
hex | 2e06e72 |
48262770 has 64 divisors (see below), whose sum is σ = 131725440. Its totient is φ = 12567744.
The previous prime is 48262769. The next prime is 48262777. The reversal of 48262770 is 7726284.
48262770 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (48262777) 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 31 ways as a sum of consecutive naturals, for example, 9532 + ... + 13688.
It is an arithmetic number, because the mean of its divisors is an integer number (2058210).
Almost surely, 248262770 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 48262770, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (65862720).
48262770 is an abundant number, since it is smaller than the sum of its proper divisors (83462670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48262770 is a wasteful number, since it uses less digits than its factorization.
48262770 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4216 (or 4210 counting only the distinct ones).
The product of its (nonzero) digits is 37632, while the sum is 36.
The square root of 48262770 is about 6947.1411386267. The cubic root of 48262770 is about 364.0860853834.
The spelling of 48262770 in words is "forty-eight million, two hundred sixty-two thousand, seven hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •