Search a number
-
+
110005051110061 = 7383173104945923
BaseRepresentation
bin11001000000110010001011…
…111111101011001010101101
3112102111101021011002202111111
4121000302023333223022231
5103404310321041010221
61025543342310352021
732112413500324132
oct3100621377531255
9472441234082444
10110005051110061
1132061975586a18
121040787105b611
13494c57c8b6793
141d243b6b08589
15cab73cdb2be1
hex640c8bfeb2ad

110005051110061 has 16 divisors (see below), whose sum is σ = 113507832263616. Its totient is φ = 106571324439936.

The previous prime is 110005051110041. The next prime is 110005051110083. The reversal of 110005051110061 is 160011150500011.

It is a cyclic number.

It is not a de Polignac number, because 110005051110061 - 211 = 110005051108013 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 2110005051110061 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 104946252.

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

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

Divisors: 1 73 83 173 6059 12629 14359 1048207 104945923 7661052379 8710511609 18155644679 635867347457 1325362061567 1506918508357 110005051110061