Base | Representation |
---|---|
bin | 100001011110001… |
… | …0100110001111011 |
3 | 2220021022220022002 |
4 | 1002330110301323 |
5 | 4300004010021 |
6 | 303240051215 |
7 | 36555164132 |
oct | 10274246173 |
9 | 2807286262 |
10 | 1123110011 |
11 | 526a6a1a1 |
12 | 274163b0b |
13 | 14b8b284a |
14 | a9236919 |
15 | 688ed50b |
hex | 42f14c7b |
1123110011 has 2 divisors, whose sum is σ = 1123110012. Its totient is φ = 1123110010.
The previous prime is 1123109993. The next prime is 1123110013. The reversal of 1123110011 is 1100113211.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (1100113211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1123110011 - 218 = 1122847867 is a prime.
It is a super-2 number, since 2×11231100112 = 2522752193616840242, which contains 22 as substring.
Together with 1123110013, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1123109974 and 1123110001.
It is not a weakly prime, because it can be changed into another prime (1123110013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561555005 + 561555006.
It is an arithmetic number, because the mean of its divisors is an integer number (561555006).
Almost surely, 21123110011 is an apocalyptic number.
1123110011 is a deficient number, since it is larger than the sum of its proper divisors (1).
1123110011 is an equidigital number, since it uses as much as digits as its factorization.
1123110011 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6, while the sum is 11.
The square root of 1123110011 is about 33512.8335268744. The cubic root of 1123110011 is about 1039.4591649872.
Adding to 1123110011 its reverse (1100113211), we get a palindrome (2223223222).
The spelling of 1123110011 in words is "one billion, one hundred twenty-three million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •