Base | Representation |
---|---|
bin | 1011100100010… |
… | …0101010111010 |
3 | 10101021212010101 |
4 | 2321010222322 |
5 | 44410001040 |
6 | 4451510014 |
7 | 1126243252 |
oct | 271045272 |
9 | 111255111 |
10 | 48515770 |
11 | 25427686 |
12 | 142b830a |
13 | a088974 |
14 | 662c962 |
15 | 43d509a |
hex | 2e44aba |
48515770 has 8 divisors (see below), whose sum is σ = 87328404. Its totient is φ = 19406304.
The previous prime is 48515749. The next prime is 48515777. The reversal of 48515770 is 7751584.
48515770 is nontrivially palindromic in base 3.
48515770 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 44076321 + 4439449 = 6639^2 + 2107^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not an unprimeable number, because it can be changed into a prime (48515777) 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 3 ways as a sum of consecutive naturals, for example, 2425779 + ... + 2425798.
Almost surely, 248515770 is an apocalyptic number.
48515770 is a deficient number, since it is larger than the sum of its proper divisors (38812634).
48515770 is a wasteful number, since it uses less digits than its factorization.
48515770 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4851584.
The product of its (nonzero) digits is 39200, while the sum is 37.
The square root of 48515770 is about 6965.3262665865. The cubic root of 48515770 is about 364.7211731821.
The spelling of 48515770 in words is "forty-eight million, five hundred fifteen thousand, seven hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •