Base | Representation |
---|---|
bin | 100001001011011… |
… | …1110011110100011 |
3 | 2212120220111000022 |
4 | 1002112332132203 |
5 | 4240002204311 |
6 | 302250144055 |
7 | 36406025645 |
oct | 10226763643 |
9 | 2776814008 |
10 | 1113319331 |
11 | 521492323 |
12 | 270a2202b |
13 | 149865347 |
14 | a7c08895 |
15 | 67b175db |
hex | 425be7a3 |
1113319331 has 2 divisors, whose sum is σ = 1113319332. Its totient is φ = 1113319330.
The previous prime is 1113319313. The next prime is 1113319397. The reversal of 1113319331 is 1339133111.
Together with previous prime (1113319313) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1113319331 - 26 = 1113319267 is a prime.
It is a super-2 number, since 2×11133193312 = 2478959865556575122, which contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1113319331.
It is not a weakly prime, because it can be changed into another prime (1113319931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556659665 + 556659666.
It is an arithmetic number, because the mean of its divisors is an integer number (556659666).
Almost surely, 21113319331 is an apocalyptic number.
1113319331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1113319331 is an equidigital number, since it uses as much as digits as its factorization.
1113319331 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 729, while the sum is 26.
The square root of 1113319331 is about 33366.4401907066. The cubic root of 1113319331 is about 1036.4298598665.
The spelling of 1113319331 in words is "one billion, one hundred thirteen million, three hundred nineteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •