Base | Representation |
---|---|
bin | 1011101010101… |
… | …1011100101111 |
3 | 10102002020121021 |
4 | 2322223130233 |
5 | 100011434001 |
6 | 4504515011 |
7 | 1132645513 |
oct | 272533457 |
9 | 112066537 |
10 | 48936751 |
11 | 256949a6 |
12 | 1447ba67 |
13 | a1a5476 |
14 | 66dc143 |
15 | 4469ba1 |
hex | 2eab72f |
48936751 has 2 divisors, whose sum is σ = 48936752. Its totient is φ = 48936750.
The previous prime is 48936731. The next prime is 48936763. The reversal of 48936751 is 15763984.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 48936751 - 215 = 48903983 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 48936698 and 48936707.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (48936731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24468375 + 24468376.
It is an arithmetic number, because the mean of its divisors is an integer number (24468376).
Almost surely, 248936751 is an apocalyptic number.
48936751 is a deficient number, since it is larger than the sum of its proper divisors (1).
48936751 is an equidigital number, since it uses as much as digits as its factorization.
48936751 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 181440, while the sum is 43.
The square root of 48936751 is about 6995.4807554592. The cubic root of 48936751 is about 365.7730559804.
The spelling of 48936751 in words is "forty-eight million, nine hundred thirty-six thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •