Search a number
-
+
101101112011 = 1991433354533
BaseRepresentation
bin101111000101000011…
…0001000101011001011
3100122221220120121222001
41132022012020223023
53124023341041021
6114240055411431
710206244162414
oct1361206105313
9318856517861
10101101112011
1139970a3a929
1217716683b77
1396c298c603
144c713ac80b
15296ac40091
hex178a188acb

101101112011 has 8 divisors (see below), whose sum is σ = 101680351200. Its totient is φ = 100522585152.

The previous prime is 101101111999. The next prime is 101101112033. The reversal of 101101112011 is 110211101101.

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

It is a cyclic number.

It is not a de Polignac number, because 101101112011 - 225 = 101067557579 is a prime.

It is a Duffinian number.

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

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

Almost surely, 2101101112011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 356165.

The product of its (nonzero) digits is 2, while the sum is 10.

Adding to 101101112011 its reverse (110211101101), we get a palindrome (211312213112).

The spelling of 101101112011 in words is "one hundred one billion, one hundred one million, one hundred twelve thousand, eleven".

Divisors: 1 199 1433 285167 354533 70552067 508045789 101101112011