Base | Representation |
---|---|
bin | 1011100101110… |
… | …0000011100101 |
3 | 10101110201112001 |
4 | 2321130003211 |
5 | 44421032212 |
6 | 4453525301 |
7 | 1130122441 |
oct | 271340345 |
9 | 111421461 |
10 | 48611557 |
11 | 25492645 |
12 | 14343831 |
13 | a0c0447 |
14 | 6655821 |
15 | 4403657 |
hex | 2e5c0e5 |
48611557 has 4 divisors (see below), whose sum is σ = 51170080. Its totient is φ = 46053036.
The previous prime is 48611531. The next prime is 48611597. The reversal of 48611557 is 75511684.
48611557 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 48611557 - 219 = 48087269 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48611597) 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, 1279233 + ... + 1279270.
It is an arithmetic number, because the mean of its divisors is an integer number (12792520).
Almost surely, 248611557 is an apocalyptic number.
It is an amenable number.
48611557 is a deficient number, since it is larger than the sum of its proper divisors (2558523).
48611557 is a wasteful number, since it uses less digits than its factorization.
48611557 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2558522.
The product of its digits is 33600, while the sum is 37.
The square root of 48611557 is about 6972.1988640600. The cubic root of 48611557 is about 364.9610441942.
The spelling of 48611557 in words is "forty-eight million, six hundred eleven thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •