Base | Representation |
---|---|
bin | 100001011100011… |
… | …0110101000110101 |
3 | 2220012121200011022 |
4 | 1002320312220311 |
5 | 4244240400432 |
6 | 303204350525 |
7 | 36544354313 |
oct | 10270665065 |
9 | 2805550138 |
10 | 1122200117 |
11 | 5264a8615 |
12 | 2739a5445 |
13 | 14b65464c |
14 | a907b0b3 |
15 | 687bdb12 |
hex | 42e36a35 |
1122200117 has 2 divisors, whose sum is σ = 1122200118. Its totient is φ = 1122200116.
The previous prime is 1122200099. The next prime is 1122200129. The reversal of 1122200117 is 7110022211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 756855121 + 365344996 = 27511^2 + 19114^2 .
It is an emirp because it is prime and its reverse (7110022211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1122200117 - 28 = 1122199861 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1122200095 and 1122200104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1122200147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561100058 + 561100059.
It is an arithmetic number, because the mean of its divisors is an integer number (561100059).
Almost surely, 21122200117 is an apocalyptic number.
It is an amenable number.
1122200117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1122200117 is an equidigital number, since it uses as much as digits as its factorization.
1122200117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 17.
The square root of 1122200117 is about 33499.2554693384. The cubic root of 1122200117 is about 1039.1783812178.
Adding to 1122200117 its reverse (7110022211), we get a palindrome (8232222328).
The spelling of 1122200117 in words is "one billion, one hundred twenty-two million, two hundred thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •