Search a number
-
+
48533056968 = 233111753211967
BaseRepresentation
bin101101001100110010…
…111010110111001000
311122021100111202002110
4231030302322313020
51243343430310333
634143515502320
73335460114624
oct551462726710
9148240452073
1048533056968
1119645711040
1294a57579a0
134765b82cb6
1424c5994184
1513e0bca063
hexb4ccbadc8

48533056968 has 256 divisors, whose sum is σ = 143618365440. Its totient is φ = 13502361600.

The previous prime is 48533056963. The next prime is 48533056987. The reversal of 48533056968 is 86965033584.

It is a happy number.

It is not an unprimeable number, because it can be changed into a prime (48533056963) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 50188821 + ... + 50189787.

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

Almost surely, 248533056968 is an apocalyptic number.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 48533056968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71809182720).

48533056968 is an abundant number, since it is smaller than the sum of its proper divisors (95085308472).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 1268 (or 1264 counting only the distinct ones).

The product of its (nonzero) digits is 18662400, while the sum is 57.

The spelling of 48533056968 in words is "forty-eight billion, five hundred thirty-three million, fifty-six thousand, nine hundred sixty-eight".