Search a number
-
+
50066651000 = 235350066651
BaseRepresentation
bin101110101000001101…
…000111011101111000
311210020020020101121102
4232220031013131320
51310014030313000
635000022030532
73421461340352
oct565015073570
9153206211542
1050066651000
111a262356a23
129853278448
13494b8080a2
1425cd5200d2
15148065d3d5
hexba8347778

50066651000 has 32 divisors (see below), whose sum is σ = 117155965680. Its totient is φ = 20026660000.

The previous prime is 50066650993. The next prime is 50066651009. The reversal of 50066651000 is 15666005.

It is a congruent number.

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

Almost surely, 250066651000 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 5400, while the sum is 29.

The spelling of 50066651000 in words is "fifty billion, sixty-six million, six hundred fifty-one thousand".

Divisors: 1 2 4 5 8 10 20 25 40 50 100 125 200 250 500 1000 50066651 100133302 200266604 250333255 400533208 500666510 1001333020 1251666275 2002666040 2503332550 5006665100 6258331375 10013330200 12516662750 25033325500 50066651000