Base | Representation |
---|---|
bin | 100001001011100… |
… | …0011100011001111 |
3 | 2212120221112111221 |
4 | 1002113003203033 |
5 | 4240003340421 |
6 | 302250424211 |
7 | 36406143352 |
oct | 10227034317 |
9 | 2776845457 |
10 | 1113340111 |
11 | 5214a69a4 |
12 | 270a32067 |
13 | 149871940 |
14 | a7c12299 |
15 | 67b1d841 |
hex | 425c38cf |
1113340111 has 4 divisors (see below), whose sum is σ = 1198981672. Its totient is φ = 1027698552.
The previous prime is 1113340103. The next prime is 1113340187. The reversal of 1113340111 is 1110433111.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1110433111 = 1951 ⋅569161.
It is a cyclic number.
It is not a de Polignac number, because 1113340111 - 23 = 1113340103 is a prime.
It is a super-2 number, since 2×11133401112 = 2479052405522984642, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1113346111) 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, 42820761 + ... + 42820786.
It is an arithmetic number, because the mean of its divisors is an integer number (299745418).
Almost surely, 21113340111 is an apocalyptic number.
1113340111 is a deficient number, since it is larger than the sum of its proper divisors (85641561).
1113340111 is an equidigital number, since it uses as much as digits as its factorization.
1113340111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85641560.
The product of its (nonzero) digits is 36, while the sum is 16.
The square root of 1113340111 is about 33366.7515799785. The cubic root of 1113340111 is about 1036.4363081148.
Adding to 1113340111 its reverse (1110433111), we get a palindrome (2223773222).
The spelling of 1113340111 in words is "one billion, one hundred thirteen million, three hundred forty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •