Base | Representation |
---|---|
bin | 1011100010011… |
… | …1111001111110 |
3 | 10101001212111200 |
4 | 2320213321332 |
5 | 44342213300 |
6 | 4445200330 |
7 | 1125242616 |
oct | 270477176 |
9 | 111055450 |
10 | 48397950 |
11 | 25357107 |
12 | 142600a6 |
13 | a047153 |
14 | 65dba46 |
15 | 43b0200 |
hex | 2e27e7e |
48397950 has 72 divisors (see below), whose sum is σ = 131181336. Its totient is φ = 12792000.
The previous prime is 48397939. The next prime is 48397969. The reversal of 48397950 is 5979384.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 48397896 and 48397905.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 58540 + ... + 59360.
It is an arithmetic number, because the mean of its divisors is an integer number (1821963).
Almost surely, 248397950 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 48397950, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (65590668).
48397950 is an abundant number, since it is smaller than the sum of its proper divisors (82783386).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48397950 is a wasteful number, since it uses less digits than its factorization.
48397950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 970 (or 962 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 45.
The square root of 48397950 is about 6956.8635174193. The cubic root of 48397950 is about 364.4256934453.
The spelling of 48397950 in words is "forty-eight million, three hundred ninety-seven thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •