Base | Representation |
---|---|
bin | 110100001010001100… |
… | …0011100010000010001 |
3 | 101201010020122111120202 |
4 | 1220110120130100101 |
5 | 3313344320214301 |
6 | 123242430344545 |
7 | 11043511436156 |
oct | 1502430342021 |
9 | 351106574522 |
10 | 112011101201 |
11 | 4355a38a21a |
12 | 1986035b155 |
13 | a74106010c |
14 | 55c832c22d |
15 | 2da894e66b |
hex | 1a1461c411 |
112011101201 has 4 divisors (see below), whose sum is σ = 112156760100. Its totient is φ = 111865442304.
The previous prime is 112011101197. The next prime is 112011101269. The reversal of 112011101201 is 102101110211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 52303690000 + 59707411201 = 228700^2 + 244351^2 .
It is a cyclic number.
It is not a de Polignac number, because 112011101201 - 22 = 112011101197 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112011103201) 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 3 ways as a sum of consecutive naturals, for example, 72828296 + ... + 72829833.
It is an arithmetic number, because the mean of its divisors is an integer number (28039190025).
Almost surely, 2112011101201 is an apocalyptic number.
It is an amenable number.
112011101201 is a deficient number, since it is larger than the sum of its proper divisors (145658899).
112011101201 is an equidigital number, since it uses as much as digits as its factorization.
112011101201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145658898.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 112011101201 its reverse (102101110211), we get a palindrome (214112211412).
The spelling of 112011101201 in words is "one hundred twelve billion, eleven million, one hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •