Search a number
-
+
48568033 = 593592293
BaseRepresentation
bin1011100101000…
…1011011100001
310101101111211001
42321101123201
544413134113
64452552001
71126551523
oct271213341
9111344731
1048568033
1125462978
1214322601
13a0a66a7
146643a13
1543e57dd
hex2e516e1

48568033 has 8 divisors (see below), whose sum is σ = 49550400. Its totient is φ = 47591088.

The previous prime is 48568021. The next prime is 48568063. The reversal of 48568033 is 33086584.

48568033 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-48568033 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 48567983 and 48568001.

It is not an unprimeable number, because it can be changed into a prime (48568063) 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 7 ways as a sum of consecutive naturals, for example, 20035 + ... + 22327.

It is an arithmetic number, because the mean of its divisors is an integer number (6193800).

Almost surely, 248568033 is an apocalyptic number.

It is an amenable number.

48568033 is a deficient number, since it is larger than the sum of its proper divisors (982367).

48568033 is a wasteful number, since it uses less digits than its factorization.

48568033 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 2711.

The product of its (nonzero) digits is 69120, while the sum is 37.

The square root of 48568033 is about 6969.0769116146. The cubic root of 48568033 is about 364.8520899418.

The spelling of 48568033 in words is "forty-eight million, five hundred sixty-eight thousand, thirty-three".

Divisors: 1 59 359 2293 21181 135287 823187 48568033