Search a number
-
+
50755655705 = 510151131141
BaseRepresentation
bin101111010001010001…
…011101100000011001
311212000020201110101012
4233101101131200121
51312421421440310
635152233503305
73444525645416
oct572121354031
9155006643335
1050755655705
111a5862763a7
129a05b71b35
134a2b497891
142656c3510d
1514c0dacc05
hexbd145d819

50755655705 has 4 divisors (see below), whose sum is σ = 60906786852. Its totient is φ = 40604524560.

The previous prime is 50755655701. The next prime is 50755655711.

50755655705 is nontrivially palindromic in base 10.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 17884515289 + 32871140416 = 133733^2 + 181304^2 .

It is not a de Polignac number, because 50755655705 - 22 = 50755655701 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 250755655705 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 10151131146.

The product of its (nonzero) digits is 4593750, while the sum is 50.

The spelling of 50755655705 in words is "fifty billion, seven hundred fifty-five million, six hundred fifty-five thousand, seven hundred five".

Divisors: 1 5 10151131141 50755655705