Base | Representation |
---|---|
bin | 1011100100010… |
… | …0111000101011 |
3 | 10101021220100000 |
4 | 2321010320223 |
5 | 44410013101 |
6 | 4451514043 |
7 | 1126245651 |
oct | 271047053 |
9 | 111256300 |
10 | 48516651 |
11 | 25428307 |
12 | 142b8923 |
13 | a0891a1 |
14 | 662cdd1 |
15 | 43d5486 |
hex | 2e44e2b |
48516651 has 12 divisors (see below), whose sum is σ = 72675512. Its totient is φ = 32344272.
The previous prime is 48516647. The next prime is 48516679. The reversal of 48516651 is 15661584.
48516651 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 48516651 - 22 = 48516647 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (48516631) 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 11 ways as a sum of consecutive naturals, for example, 99586 + ... + 100071.
Almost surely, 248516651 is an apocalyptic number.
48516651 is a deficient number, since it is larger than the sum of its proper divisors (24158861).
48516651 is an equidigital number, since it uses as much as digits as its factorization.
48516651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 199672 (or 199660 counting only the distinct ones).
The product of its digits is 28800, while the sum is 36.
The square root of 48516651 is about 6965.3895081323. The cubic root of 48516651 is about 364.7233808314.
The spelling of 48516651 in words is "forty-eight million, five hundred sixteen thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •