Search a number
-
+
51010001105 = 572363366461
BaseRepresentation
bin101111100000011011…
…101101100011010001
311212122222022112200012
4233200123231203101
51313432030013410
635233401204305
73454034566250
oct574033554321
9155588275605
1051010001105
111a6a68a7908
129a77190695
134a6c09c10b
14267c922797
1514d839e605
hexbe06ed8d1

51010001105 has 16 divisors (see below), whose sum is σ = 72998164224. Its totient is φ = 33457490880.

The previous prime is 51010001071. The next prime is 51010001111. The reversal of 51010001105 is 50110001015.

It is not a de Polignac number, because 51010001105 - 210 = 51010000081 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 51010001105.

It is an unprimeable number.

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, 31682426 + ... + 31684035.

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

Almost surely, 251010001105 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 63366496.

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

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

Divisors: 1 5 7 23 35 115 161 805 63366461 316832305 443565227 1457428603 2217826135 7287143015 10202000221 51010001105