Base | Representation |
---|---|
bin | 1011011101001… |
… | …1000101000000 |
3 | 10100102012220000 |
4 | 2313103011000 |
5 | 44300103441 |
6 | 4433520000 |
7 | 1122264624 |
oct | 267230500 |
9 | 110365800 |
10 | 48050496 |
11 | 2513a05a |
12 | 14113000 |
13 | 9c54c60 |
14 | 654b184 |
15 | 43422b6 |
hex | 2dd3140 |
48050496 has 280 divisors, whose sum is σ = 165225984. Its totient is φ = 13685760.
The previous prime is 48050459. The next prime is 48050503. The reversal of 48050496 is 69405084.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 48050496.
It is a congruent number.
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 39 ways as a sum of consecutive naturals, for example, 1550001 + ... + 1550031.
Almost surely, 248050496 is an apocalyptic number.
48050496 is a gapful number since it is divisible by the number (46) 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 48050496, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82612992).
48050496 is an abundant number, since it is smaller than the sum of its proper divisors (117175488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48050496 is a wasteful number, since it uses less digits than its factorization.
48050496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91 (or 72 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The square root of 48050496 is about 6931.8465072447. The cubic root of 48050496 is about 363.5515146276.
The spelling of 48050496 in words is "forty-eight million, fifty thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •