Search a number
-
+
50105130501 = 3101165363467
BaseRepresentation
bin101110101010011111…
…111001111000000101
311210022220122100120010
4232222133321320011
51310103403134001
635003514500433
73422436403446
oct565237717005
9153286570503
1050105130501
111a282049168
129864134719
13495678b81a
1425d46992cd
151483c0e8d6
hexbaa7f9e05

50105130501 has 8 divisors (see below), whose sum is σ = 67468294944. Its totient is φ = 33072693200.

The previous prime is 50105130497. The next prime is 50105130503. The reversal of 50105130501 is 10503150105.

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 50105130501 - 22 = 50105130497 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 250105130501 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 165363571.

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

Adding to 50105130501 its reverse (10503150105), we get a palindrome (60608280606).

The spelling of 50105130501 in words is "fifty billion, one hundred five million, one hundred thirty thousand, five hundred one".

Divisors: 1 3 101 303 165363467 496090401 16701710167 50105130501