Search a number
-
+
101106111001 = 743335900701
BaseRepresentation
bin101111000101001100…
…1001101001000011001
3100122222020222121021211
41132022121031020121
53124031131023001
6114240354503121
710206334522630
oct1361231151031
9318866877254
10101106111001
1139973844725
1217718294aa1
1396c3a1caac
144c71d10517
15296b3cb351
hex178a64d219

101106111001 has 8 divisors (see below), whose sum is σ = 118237047104. Its totient is φ = 84646976400.

The previous prime is 101106110983. The next prime is 101106111037. The reversal of 101106111001 is 100111601101.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 101106111001 - 29 = 101106110489 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (101106111061) 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 7 ways as a sum of consecutive naturals, for example, 167950050 + ... + 167950651.

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

Almost surely, 2101106111001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 335900751.

The product of its (nonzero) digits is 6, while the sum is 13.

Adding to 101106111001 its reverse (100111601101), we get a palindrome (201217712102).

The spelling of 101106111001 in words is "one hundred one billion, one hundred six million, one hundred eleven thousand, one".

Divisors: 1 7 43 301 335900701 2351304907 14443730143 101106111001