Search a number
-
+
101110131001 = 1147941207833
BaseRepresentation
bin101111000101010100…
…0100010100100111001
3100122222112112211200201
41132022220202210321
53124033143143001
6114241021002201
710206413635015
oct1361250424471
9318875484621
10101110131001
113997603aa40
12177196b3361
1396c47c97a9
144c72679545
15296b922501
hex178aa22939

101110131001 has 16 divisors (see below), whose sum is σ = 112769065728. Its totient is φ = 89866556800.

The previous prime is 101110130963. The next prime is 101110131043. The reversal of 101110131001 is 100131011101.

It is not a de Polignac number, because 101110131001 - 29 = 101110130489 is a prime.

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

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

Almost surely, 2101110131001 is an apocalyptic number.

101110131001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 208832.

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

Adding to 101110131001 its reverse (100131011101), we get a palindrome (201241142102).

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

Divisors: 1 11 47 517 941 10351 44227 207833 486497 2286163 9768151 107449661 195570853 2151279383 9191830091 101110131001