Search a number
-
+
50110501053 = 348119347129
BaseRepresentation
bin101110101010110100…
…011001000010111101
311210100021202012120110
4232222310121002331
51310111242013203
635004225540233
73422533142154
oct565264310275
9153307665513
1050110501053
111a285087138
129865aa4679
13495791c172
1425d529659b
151484420d03
hexbaad190bd

50110501053 has 8 divisors (see below), whose sum is σ = 66815582400. Its totient is φ = 33406210208.

The previous prime is 50110501033. The next prime is 50110501151. The reversal of 50110501053 is 35010501105.

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

It is a cyclic number.

It is not a de Polignac number, because 50110501053 - 228 = 49842065597 is a prime.

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

It is a Curzon number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (50110501033) 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, 29208 + ... + 317921.

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

Almost surely, 250110501053 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 395251.

The product of its (nonzero) digits is 375, while the sum is 21.

The spelling of 50110501053 in words is "fifty billion, one hundred ten million, five hundred one thousand, fifty-three".

Divisors: 1 3 48119 144357 347129 1041387 16703500351 50110501053