Base | Representation |
---|---|
bin | 100001011100010… |
… | …0000111000100101 |
3 | 2220012110010221011 |
4 | 1002320200320211 |
5 | 4244230023023 |
6 | 303202422221 |
7 | 36543533452 |
oct | 10270407045 |
9 | 2805403834 |
10 | 1122111013 |
11 | 526447681 |
12 | 273961971 |
13 | 14b622c1a |
14 | a9056829 |
15 | 687a250d |
hex | 42e20e25 |
1122111013 has 2 divisors, whose sum is σ = 1122111014. Its totient is φ = 1122111012.
The previous prime is 1122110989. The next prime is 1122111019. The reversal of 1122111013 is 3101112211.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 633126244 + 488984769 = 25162^2 + 22113^2 .
It is an emirp because it is prime and its reverse (3101112211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1122111013 - 25 = 1122110981 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1122110984 and 1122111002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1122111019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561055506 + 561055507.
It is an arithmetic number, because the mean of its divisors is an integer number (561055507).
Almost surely, 21122111013 is an apocalyptic number.
It is an amenable number.
1122111013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1122111013 is an equidigital number, since it uses as much as digits as its factorization.
1122111013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 13.
The square root of 1122111013 is about 33497.9255029323. The cubic root of 1122111013 is about 1039.1508764974.
Adding to 1122111013 its reverse (3101112211), we get a palindrome (4223223224).
The spelling of 1122111013 in words is "one billion, one hundred twenty-two million, one hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •