Search a number
-
+
51105001101065 = 531398903826541
BaseRepresentation
bin10111001111010110011110…
…11011111101011100001001
320200221120221101200021210222
423213223033123331130021
523144301020240213230
6300405151405515425
713523133366000212
oct1347531733753411
9220846841607728
1051105001101065
11153135668a935a
1258945a9572b75
132269247654042
14c896d0d7c409
155d95596d36e5
hex2e7acf6fd709

51105001101065 has 16 divisors (see below), whose sum is σ = 63304494713856. Its totient is φ = 39565015089600.

The previous prime is 51105001101031. The next prime is 51105001101101. The reversal of 51105001101065 is 56010110050115.

It is not a de Polignac number, because 51105001101065 - 220 = 51105000052489 is a prime.

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

It is a Duffinian number.

It is a Curzon number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

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

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

Almost surely, 251105001101065 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1225480.

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

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

Divisors: 1 5 31 155 398903 826541 1994515 4132705 12365993 25622771 61829965 128113855 329709684523 1648548422615 10221000220213 51105001101065