Search a number
-
+
112001111001 = 3213957274453
BaseRepresentation
bin110100001001111001…
…0010101001111011001
3101201002112211221121100
41220103302111033121
53313334241023001
6123241432302013
711043330510213
oct1502362251731
9351075757540
10112001111001
114355478645a
1219858b41909
13a73bc72b60
1455c6c8b5b3
152da7b29586
hex1a13c953d9

112001111001 has 12 divisors (see below), whose sum is σ = 174223950628. Its totient is φ = 68923760544.

The previous prime is 112001110997. The next prime is 112001111021. The reversal of 112001111001 is 100111100211.

It can be written as a sum of positive squares in 2 ways, for example, as 61903928025 + 50097182976 = 248805^2 + 223824^2 .

It is not a de Polignac number, because 112001111001 - 22 = 112001110997 is a prime.

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 (112001111021) 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, 478637110 + ... + 478637343.

Almost surely, 2112001111001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 112001111001 its reverse (100111100211), we get a palindrome (212112211212).

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

Divisors: 1 3 9 13 39 117 957274453 2871823359 8615470077 12444567889 37333703667 112001111001