Search a number
-
+
50802066432 = 2103313281503
BaseRepresentation
bin101111010100000010…
…100000010000000000
311212010111001100221000
4233110002200100000
51313020312111212
635201012332000
73445631303565
oct572402402000
9155114040830
1050802066432
111a5aa495477
129a19614000
134a37c97350
14265d07686c
1514c4ec91dc
hexbd40a0400

50802066432 has 352 divisors, whose sum is σ = 162924168960. Its totient is φ = 15544811520.

The previous prime is 50802066409. The next prime is 50802066443. The reversal of 50802066432 is 23466020805.

50802066432 is a `hidden beast` number, since 5 + 0 + 8 + 0 + 2 + 0 + 6 + 643 + 2 = 666.

It is a super-3 number, since 3×508020664323 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 100997893 + ... + 100998395.

Almost surely, 250802066432 is an apocalyptic number.

50802066432 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 50802066432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (81462084480).

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

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

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

50802066432 is an evil number, because the sum of its binary digits is even.

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

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

The spelling of 50802066432 in words is "fifty billion, eight hundred two million, sixty-six thousand, four hundred thirty-two".