Search a number
-
+
50056010601 = 3231574620697
BaseRepresentation
bin101110100111100100…
…100001101101101001
311210012111012210201120
4232213210201231221
51310003314314401
634555002005453
73421302032652
oct564744415551
9153174183646
1050056010601
111a257349703
12984b7a6889
134949550bac
1425cbd50529
15147e75a836
hexba7921b69

50056010601 has 16 divisors (see below), whose sum is σ = 70086747264. Its totient is φ = 31716457344.

The previous prime is 50056010579. The next prime is 50056010617. The reversal of 50056010601 is 10601065005.

It is not a de Polignac number, because 50056010601 - 25 = 50056010569 is a prime.

It is a super-3 number, since 3×500560106013 (a number of 33 digits) contains 333 as substring.

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

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

Almost surely, 250056010601 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 4620880.

The product of its (nonzero) digits is 900, while the sum is 24.

Adding to 50056010601 its reverse (10601065005), we get a palindrome (60657075606).

The spelling of 50056010601 in words is "fifty billion, fifty-six million, ten thousand, six hundred one".

Divisors: 1 3 23 69 157 471 3611 10833 4620697 13862091 106276031 318828093 725449429 2176348287 16685336867 50056010601