Search a number
-
+
50342936915 = 533130418693
BaseRepresentation
bin101110111000101011…
…000100000101010011
311210221111010011122002
4232320223010011103
51311100242440130
635043251504215
73431354621555
oct567053040523
9153844104562
1050342936915
111a394303697
12990b8b806b
134993b2208b
1426180bd4d5
151499a35b45
hexbb8ac4153

50342936915 has 8 divisors (see below), whose sum is σ = 60594038448. Its totient is φ = 40152673440.

The previous prime is 50342936911. The next prime is 50342936939. The reversal of 50342936915 is 51963924305.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 50342936915 - 22 = 50342936911 is a prime.

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

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 50342936915.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15207692 + ... + 15211001.

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

Almost surely, 250342936915 is an apocalyptic number.

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

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

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

The sum of its prime factors is 30419029.

The product of its (nonzero) digits is 874800, while the sum is 47.

The spelling of 50342936915 in words is "fifty billion, three hundred forty-two million, nine hundred thirty-six thousand, nine hundred fifteen".

Divisors: 1 5 331 1655 30418693 152093465 10068587383 50342936915