Search a number
-
+
112011201001 = 716001600143
BaseRepresentation
bin110100001010001100…
…0110100100111101001
3101201010020211120111001
41220110120310213221
53313344331413001
6123242432435001
711043512333140
oct1502430644751
9351106746431
10112011201001
114355a4481a7
12198603a8a61
13a74109667b
1455c8356757
152da896e001
hex1a146349e9

112011201001 has 4 divisors (see below), whose sum is σ = 128012801152. Its totient is φ = 96009600852.

The previous prime is 112011200999. The next prime is 112011201031. The reversal of 112011201001 is 100102110211.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 112011201001 - 21 = 112011200999 is a prime.

It is a Duffinian number.

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

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

Almost surely, 2112011201001 is an apocalyptic number.

It is an amenable number.

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

112011201001 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 16001600150.

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

Adding to 112011201001 its reverse (100102110211), we get a palindrome (212113311212).

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

Divisors: 1 7 16001600143 112011201001