Base | Representation |
---|---|
bin | 1011100100111… |
… | …1101000000011 |
3 | 10101101010200100 |
4 | 2321033220003 |
5 | 44412420033 |
6 | 4452453443 |
7 | 1126521135 |
oct | 271175003 |
9 | 111333610 |
10 | 48560643 |
11 | 2545836a |
12 | 1431a283 |
13 | a0a3211 |
14 | 6641055 |
15 | 43e3513 |
hex | 2e4fa03 |
48560643 has 12 divisors (see below), whose sum is σ = 70325008. Its totient is φ = 32289840.
The previous prime is 48560639. The next prime is 48560647. The reversal of 48560643 is 34606584.
48560643 is a `hidden beast` number, since 4 + 8 + 5 + 6 + 0 + 643 = 666.
48560643 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (48560639) and next prime (48560647).
It is not a de Polignac number, because 48560643 - 22 = 48560639 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 48560598 and 48560607.
It is not an unprimeable number, because it can be changed into a prime (48560647) 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, 3223 + ... + 10368.
Almost surely, 248560643 is an apocalyptic number.
48560643 is a deficient number, since it is larger than the sum of its proper divisors (21764365).
48560643 is a wasteful number, since it uses less digits than its factorization.
48560643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13994 (or 13991 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 36.
The square root of 48560643 is about 6968.5466921016. The cubic root of 48560643 is about 364.8335839854.
The spelling of 48560643 in words is "forty-eight million, five hundred sixty thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •