Base | Representation |
---|---|
bin | 100001011011110… |
… | …1011011101110011 |
3 | 2220012001000210101 |
4 | 1002313223131303 |
5 | 4244201022321 |
6 | 303154013231 |
7 | 36541632526 |
oct | 10267533563 |
9 | 2805030711 |
10 | 1121892211 |
11 | 526308250 |
12 | 273877217 |
13 | 14b57745b |
14 | a8ddabbd |
15 | 6875c791 |
hex | 42deb773 |
1121892211 has 8 divisors (see below), whose sum is σ = 1224124848. Its totient is φ = 1019700000.
The previous prime is 1121892199. The next prime is 1121892217. The reversal of 1121892211 is 1122981211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-1121892211 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1121892211.
It is not an unprimeable number, because it can be changed into a prime (1121892217) 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 7 ways as a sum of consecutive naturals, for example, 103761 + ... + 114061.
It is an arithmetic number, because the mean of its divisors is an integer number (153015606).
Almost surely, 21121892211 is an apocalyptic number.
1121892211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1121892211 is a deficient number, since it is larger than the sum of its proper divisors (102232637).
1121892211 is a wasteful number, since it uses less digits than its factorization.
1121892211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20213.
The product of its digits is 576, while the sum is 28.
The square root of 1121892211 is about 33494.6594399764. The cubic root of 1121892211 is about 1039.0833302780.
The spelling of 1121892211 in words is "one billion, one hundred twenty-one million, eight hundred ninety-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •