Search a number
-
+
50499601152 = 28371113231163
BaseRepresentation
bin101111000010000000…
…101100001100000000
311211100101220112120020
4233002000230030000
51311410344214102
635111005413440
73435266345610
oct570200541400
9154311815506
1050499601152
111a464787870
12995426a280
1349ba415400
142630c20a40
1514a867ebbc
hexbc202c300

50499601152 has 864 divisors, whose sum is σ = 188450390016. Its totient is φ = 11645337600.

The previous prime is 50499601133. The next prime is 50499601169. The reversal of 50499601152 is 25110699405.

It is a super-2 number, since 2×504996011522 (a number of 22 digits) contains 22 as substring.

It is a Harshad number since it is a multiple of its sum of digits (42).

It is an unprimeable number.

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

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 309813423 + ... + 309813585.

Almost surely, 250499601152 is an apocalyptic number.

50499601152 is a gapful number since it is divisible by the number (52) formed by its first and last digit.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 97200, while the sum is 42.

The spelling of 50499601152 in words is "fifty billion, four hundred ninety-nine million, six hundred one thousand, one hundred fifty-two".