Base | Representation |
---|---|
bin | 1011100110010… |
… | …1001101001001 |
3 | 10101112121221001 |
4 | 2321211031021 |
5 | 44423232113 |
6 | 4454415001 |
7 | 1130336626 |
oct | 271451511 |
9 | 111477831 |
10 | 48649033 |
11 | 25508814 |
12 | 14361461 |
13 | a104514 |
14 | 666534d |
15 | 440e7dd |
hex | 2e65349 |
48649033 has 2 divisors, whose sum is σ = 48649034. Its totient is φ = 48649032.
The previous prime is 48649031. The next prime is 48649049. The reversal of 48649033 is 33094684.
48649033 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 46063369 + 2585664 = 6787^2 + 1608^2 .
It is a cyclic number.
It is not a de Polignac number, because 48649033 - 21 = 48649031 is a prime.
Together with 48649031, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 48648983 and 48649001.
It is not a weakly prime, because it can be changed into another prime (48649031) 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 as a sum of consecutive naturals, namely, 24324516 + 24324517.
It is an arithmetic number, because the mean of its divisors is an integer number (24324517).
Almost surely, 248649033 is an apocalyptic number.
It is an amenable number.
48649033 is a deficient number, since it is larger than the sum of its proper divisors (1).
48649033 is an equidigital number, since it uses as much as digits as its factorization.
48649033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 62208, while the sum is 37.
The square root of 48649033 is about 6974.8858772026. The cubic root of 48649033 is about 365.0548063070.
The spelling of 48649033 in words is "forty-eight million, six hundred forty-nine thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •