Search a number
-
+
50601001101051 = 3163320332306753
BaseRepresentation
bin10111000000101011101101…
…01100100010011011111011
320122011102000202202112002210
423200111312230202123323
523113021322240213201
6255341440132430203
713441541656454112
oct1340256654423373
9218142022675083
1050601001101051
1115139844a57725
125812990a78363
1322308668b486b
14c6d15c804c79
155cb3ac82a1d6
hex2e0576b226fb

50601001101051 has 16 divisors (see below), whose sum is σ = 67903110919296. Its totient is φ = 33516575248896.

The previous prime is 50601001101023. The next prime is 50601001101071. The reversal of 50601001101051 is 15010110010605.

It is a happy number.

It is not a de Polignac number, because 50601001101051 - 25 = 50601001101019 is a prime.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14587110 + ... + 17719643.

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

Almost surely, 250601001101051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 32310122.

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

Adding to 50601001101051 its reverse (15010110010605), we get a palindrome (65611111111656).

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

Divisors: 1 3 163 489 3203 9609 522089 1566267 32306753 96920259 5266000739 15798002217 103478529859 310435589577 16867000367017 50601001101051