Search a number
-
+
105055511061 = 335018503687
BaseRepresentation
bin110000111010111001…
…0111110001000010101
3101001011111110220200010
41201311302332020111
53210123202323221
6120132320110433
710406242052544
oct1416562761025
9331144426603
10105055511061
1140610108416
121843aa65419
139ba3005cc7
14512865215b
152aecea8c76
hex1875cbe215

105055511061 has 4 divisors (see below), whose sum is σ = 140074014752. Its totient is φ = 70037007372.

The previous prime is 105055511053. The next prime is 105055511107. The reversal of 105055511061 is 160115550501.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 105055511061 - 23 = 105055511053 is a prime.

It is a super-2 number, since 2×1050555110612 (a number of 23 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 (105055511261) by changing a digit.

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, 17509251841 + ... + 17509251846.

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

Almost surely, 2105055511061 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 35018503690.

The product of its (nonzero) digits is 3750, while the sum is 30.

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

Divisors: 1 3 35018503687 105055511061