Search a number
-
+
50061010505 = 5117123953639
BaseRepresentation
bin101110100111110111…
…100110011001001001
311210012211121211022012
4232213313212121021
51310011104314010
634555301105305
73421362365642
oct564767463111
9153184554265
1050061010505
111a25a154160
1298513b8235
13494a5b190c
1425cc8926c9
15147ede7005
hexba7de6649

50061010505 has 32 divisors (see below), whose sum is σ = 66736742400. Its totient is φ = 35744363200.

The previous prime is 50061010499. The next prime is 50061010529. The reversal of 50061010505 is 50501016005.

It is not a de Polignac number, because 50061010505 - 224 = 50044233289 is a prime.

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

It is a Curzon number.

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 906476 + ... + 960114.

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

Almost surely, 250061010505 is an apocalyptic number.

50061010505 is a gapful number since it is divisible by the number (55) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 53965.

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

It can be divided in two parts, 500610 and 10505, that added together give a palindrome (511115).

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

Divisors: 1 5 11 55 71 239 355 781 1195 2629 3905 13145 16969 53639 84845 186659 268195 590029 933295 2950145 3808369 12819721 19041845 41892059 64098605 141016931 209460295 705084655 910200191 4551000955 10012202101 50061010505