Search a number
-
+
101105011061 = 432351279327
BaseRepresentation
bin101111000101001010…
…1000000100101110101
3100122222011220201110022
41132022111000211311
53124030340323221
6114240315134525
710206322262045
oct1361225004565
9318864821408
10101105011061
113997316328a
1217717a44445
1396c3726242
144c71b05725
15296b2604ab
hex178a540975

101105011061 has 4 divisors (see below), whose sum is σ = 103456290432. Its totient is φ = 98753731692.

The previous prime is 101105011057. The next prime is 101105011109. The reversal of 101105011061 is 160110501101.

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 a cyclic number.

It is not a de Polignac number, because 101105011061 - 22 = 101105011057 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (101105011661) by changing a digit.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1175639621 + ... + 1175639706.

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

Almost surely, 2101105011061 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2351279370.

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

Adding to 101105011061 its reverse (160110501101), we get a palindrome (261215512162).

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

Divisors: 1 43 2351279327 101105011061