Search a number
-
+
50936937603 = 323232096369
BaseRepresentation
bin101111011100000100…
…111111110010000011
311212110212211112101120
4233130010333302003
51313304324000403
635222231203323
73452156553156
oct573404776203
9155425745346
1050936937603
111a669634152
129a56816543
134a59bca086
142672d43c9d
1514d1c6ae53
hexbdc13fc83

50936937603 has 12 divisors (see below), whose sum is σ = 70997170440. Its totient is φ = 32481524416.

The previous prime is 50936937539. The next prime is 50936937617. The reversal of 50936937603 is 30673963905.

It is not a de Polignac number, because 50936937603 - 26 = 50936937539 is a prime.

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

It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 16046598 + ... + 16049771.

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

Almost surely, 250936937603 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 2755620, while the sum is 51.

The spelling of 50936937603 in words is "fifty billion, nine hundred thirty-six million, nine hundred thirty-seven thousand, six hundred three".

Divisors: 1 3 23 69 529 1587 32096369 96289107 738216487 2214649461 16978979201 50936937603