Base | Representation |
---|---|
bin | 1011100101011… |
… | …1000001100110 |
3 | 10101102200020211 |
4 | 2321113001212 |
5 | 44414402300 |
6 | 4453250034 |
7 | 1130005402 |
oct | 271270146 |
9 | 111380224 |
10 | 48590950 |
11 | 25479111 |
12 | 1433391a |
13 | a0b3c55 |
14 | 664c102 |
15 | 43ec4ba |
hex | 2e57066 |
48590950 has 96 divisors (see below), whose sum is σ = 102850560. Its totient is φ = 17001600.
The previous prime is 48590933. The next prime is 48590959. The reversal of 48590950 is 5909584.
48590950 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×485909502 = 4722160843805000, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48590959) 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, 1033827 + ... + 1033873.
It is an arithmetic number, because the mean of its divisors is an integer number (1071360).
It is a vampire number, since it can be written as 5405 ⋅ 8990 (with its own digits).
Almost surely, 248590950 is an apocalyptic number.
48590950 is an abundant number, since it is smaller than the sum of its proper divisors (54259610).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48590950 is a wasteful number, since it uses less digits than its factorization.
48590950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142 (or 137 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 40.
The square root of 48590950 is about 6970.7209096334. The cubic root of 48590950 is about 364.9094665060.
The spelling of 48590950 in words is "forty-eight million, five hundred ninety thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •