Base | Representation |
---|---|
bin | 1011011101010… |
… | …1000000111001 |
3 | 10100102121202200 |
4 | 2313111000321 |
5 | 44300332200 |
6 | 4434020413 |
7 | 1122330012 |
oct | 267250071 |
9 | 110377680 |
10 | 48058425 |
11 | 25145008 |
12 | 14117709 |
13 | 9c5874c |
14 | 6550009 |
15 | 4344800 |
hex | 2dd5039 |
48058425 has 36 divisors (see below), whose sum is σ = 86661120. Its totient is φ = 25457760.
The previous prime is 48058421. The next prime is 48058441. The reversal of 48058425 is 52485084.
48058425 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 48058425 - 22 = 48058421 is a prime.
It is a super-2 number, since 2×480584252 = 4619224426961250, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 48058425.
It is not an unprimeable number, because it can be changed into a prime (48058421) 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 35 ways as a sum of consecutive naturals, for example, 36936 + ... + 38214.
Almost surely, 248058425 is an apocalyptic number.
48058425 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
48058425 is a deficient number, since it is larger than the sum of its proper divisors (38602695).
48058425 is a wasteful number, since it uses less digits than its factorization.
48058425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1462 (or 1454 counting only the distinct ones).
The product of its (nonzero) digits is 51200, while the sum is 36.
The square root of 48058425 is about 6932.4184091845. The cubic root of 48058425 is about 363.5715105461.
The spelling of 48058425 in words is "forty-eight million, fifty-eight thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •