Base | Representation |
---|---|
bin | 100001011100010… |
… | …0000111011101101 |
3 | 2220012110011012120 |
4 | 1002320200323231 |
5 | 4244230024323 |
6 | 303202423153 |
7 | 36543534156 |
oct | 10270407355 |
9 | 2805404176 |
10 | 1122111213 |
11 | 526447843 |
12 | 273961ab9 |
13 | 14b623042 |
14 | a905692d |
15 | 687a25e3 |
hex | 42e20eed |
1122111213 has 4 divisors (see below), whose sum is σ = 1496148288. Its totient is φ = 748074140.
The previous prime is 1122111209. The next prime is 1122111233. The reversal of 1122111213 is 3121112211.
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 1122111213 - 22 = 1122111209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1122111192 and 1122111201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122111203) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 187018533 + ... + 187018538.
It is an arithmetic number, because the mean of its divisors is an integer number (374037072).
Almost surely, 21122111213 is an apocalyptic number.
It is an amenable number.
1122111213 is a deficient number, since it is larger than the sum of its proper divisors (374037075).
1122111213 is an equidigital number, since it uses as much as digits as its factorization.
1122111213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 374037074.
The product of its digits is 24, while the sum is 15.
The square root of 1122111213 is about 33497.9284881916. The cubic root of 1122111213 is about 1039.1509382353.
Adding to 1122111213 its reverse (3121112211), we get a palindrome (4243223424).
The spelling of 1122111213 in words is "one billion, one hundred twenty-two million, one hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •