Search a number
-
+
101110131 = 3223414799
BaseRepresentation
bin1100000011011…
…01000101110011
321001020221000200
412001231011303
5201341011011
614011050243
72335264503
oct601550563
9231227020
10101110131
115208a5a1
1229a40983
1317c41ba5
14d5dda03
158d23856
hex606d173

101110131 has 12 divisors (see below), whose sum is σ = 146140800. Its totient is φ = 67363920.

The previous prime is 101110099. The next prime is 101110133. The reversal of 101110131 is 131011101.

It is not a de Polignac number, because 101110131 - 25 = 101110099 is a prime.

It is a super-2 number, since 2×1011101312 = 20446517181674322, which contains 22 as substring.

It is a Harshad number since it is a multiple of its sum of digits (9).

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 18670 + ... + 23468.

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

Almost surely, 2101110131 is an apocalyptic number.

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

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

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

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

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

The square root of 101110131 is about 10055.3533503304. The cubic root of 101110131 is about 465.8701569886.

Adding to 101110131 its reverse (131011101), we get a palindrome (232121232).

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

Divisors: 1 3 9 2341 4799 7023 14397 21069 43191 11234459 33703377 101110131