Search a number
-
+
105065500055 = 521013100011
BaseRepresentation
bin110000111011001100…
…1000100110110010111
3101001012012021101222212
41201312121010312113
53210133232000210
6120133314144035
710406423005145
oct1416631046627
9331165241885
10105065500055
114061581028a
121844228201b
139ba50c2859
145129ad2595
152aedccd805
hex1876644d97

105065500055 has 4 divisors (see below), whose sum is σ = 126078600072. Its totient is φ = 84052400040.

The previous prime is 105065500019. The next prime is 105065500193. The reversal of 105065500055 is 550005560501.

It is a semiprime because it is the product of two primes.

It is not a de Polignac number, because 105065500055 - 230 = 103991758231 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 105065499994 and 105065500030.

It is a congruent number.

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 3 ways as a sum of consecutive naturals, for example, 10506550001 + ... + 10506550010.

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

Almost surely, 2105065500055 is an apocalyptic number.

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

105065500055 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 21013100016.

The product of its (nonzero) digits is 18750, while the sum is 32.

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

Divisors: 1 5 21013100011 105065500055