Base | Representation |
---|---|
bin | 100001011000011… |
… | …1001110111110011 |
3 | 2220001200210120121 |
4 | 1002300321313303 |
5 | 4243222204321 |
6 | 303051551111 |
7 | 36520554634 |
oct | 10260716763 |
9 | 2801623517 |
10 | 1120116211 |
11 | 525304985 |
12 | 27315b497 |
13 | 14b0a4c76 |
14 | a8a9788b |
15 | 6850b441 |
hex | 42c39df3 |
1120116211 has 8 divisors (see below), whose sum is σ = 1160653824. Its totient is φ = 1079853960.
The previous prime is 1120116199. The next prime is 1120116227. The reversal of 1120116211 is 1126110211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1120116211 - 27 = 1120116083 is a prime.
It is a super-2 number, since 2×11201162112 = 2509320652289993042, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1120116311) 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 7 ways as a sum of consecutive naturals, for example, 60541 + ... + 76846.
It is an arithmetic number, because the mean of its divisors is an integer number (145081728).
Almost surely, 21120116211 is an apocalyptic number.
1120116211 is a deficient number, since it is larger than the sum of its proper divisors (40537613).
1120116211 is a wasteful number, since it uses less digits than its factorization.
1120116211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137681.
The product of its (nonzero) digits is 24, while the sum is 16.
The square root of 1120116211 is about 33468.1372502265. The cubic root of 1120116211 is about 1038.5347372787.
Adding to 1120116211 its reverse (1126110211), we get a palindrome (2246226422).
The spelling of 1120116211 in words is "one billion, one hundred twenty million, one hundred sixteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •