Search a number
-
+
50015110561 = 1322338944351
BaseRepresentation
bin101110100101001000…
…100000010110100001
311210002122020212102021
4232211020200112201
51304412332014221
634550541221441
73420264265603
oct564510402641
9153078225367
1050015110561
111a236253919
129839b61881
134940c307a0
1425c6745173
15147ad7c041
hexba52205a1

50015110561 has 16 divisors (see below), whose sum is σ = 54244270080. Its totient is φ = 45841579200.

The previous prime is 50015110517. The next prime is 50015110571. The reversal of 50015110561 is 16501151005.

It is a cyclic number.

It is not a de Polignac number, because 50015110561 - 27 = 50015110433 is a prime.

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

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

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

Almost surely, 250015110561 is an apocalyptic number.

It is an amenable number.

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

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

50015110561 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 44976.

The product of its (nonzero) digits is 750, while the sum is 25.

Adding to 50015110561 its reverse (16501151005), we get a palindrome (66516261566).

The spelling of 50015110561 in words is "fifty billion, fifteen million, one hundred ten thousand, five hundred sixty-one".

Divisors: 1 13 223 389 2899 5057 44351 86747 576563 1127711 9890273 17252539 128573549 224283007 3847316197 50015110561