Search a number
-
+
101131102001 = 1721918417611
BaseRepresentation
bin101111000101111100…
…0100010011100110001
3100200001000000021111102
41132023320202130301
53124104030231001
6114243050254145
710210060116656
oct1361370423461
9320030007442
10101131102001
1139986963846
1217724727355
1396c8c5cb77
144c75377c2d
15296d6b5e6b
hex178be22731

101131102001 has 12 divisors (see below), whose sum is σ = 113084137680. Its totient is φ = 90172618560.

The previous prime is 101131101997. The next prime is 101131102019. The reversal of 101131102001 is 100201131101.

It is a happy number.

It is not a de Polignac number, because 101131102001 - 22 = 101131101997 is a prime.

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

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

Almost surely, 2101131102001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 18417664 (or 18417647 counting only the distinct ones).

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

Adding to 101131102001 its reverse (100201131101), we get a palindrome (201332233102).

The spelling of 101131102001 in words is "one hundred one billion, one hundred thirty-one million, one hundred two thousand, one".

Divisors: 1 17 19 289 323 5491 18417611 313099387 349934609 5322689579 5948888353 101131102001