Base | Representation |
---|---|
bin | 100001101101010… |
… | …1111100101010101 |
3 | 2220211100000201100 |
4 | 1003122233211111 |
5 | 4304024142432 |
6 | 304123020313 |
7 | 40013025222 |
oct | 10332574525 |
9 | 2824300640 |
10 | 1131084117 |
11 | 530516269 |
12 | 27696a699 |
13 | 150445257 |
14 | aa310949 |
15 | 6947607c |
hex | 436af955 |
1131084117 has 54 divisors (see below), whose sum is σ = 1789350498. Its totient is φ = 687896064.
The previous prime is 1131084113. The next prime is 1131084131. The reversal of 1131084117 is 7114801311.
It can be written as a sum of positive squares in 3 ways, for example, as 328551876 + 802532241 = 18126^2 + 28329^2 .
It is not a de Polignac number, because 1131084117 - 22 = 1131084113 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1131084113) 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 in 53 ways as a sum of consecutive naturals, for example, 11660613 + ... + 11660709.
Almost surely, 21131084117 is an apocalyptic number.
It is an amenable number.
1131084117 is a deficient number, since it is larger than the sum of its proper divisors (658266381).
1131084117 is an equidigital number, since it uses as much as digits as its factorization.
1131084117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 275 (or 156 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 27.
The square root of 1131084117 is about 33631.5940300189. The cubic root of 1131084117 is about 1041.9134267273.
Adding to 1131084117 its reverse (7114801311), we get a palindrome (8245885428).
It can be divided in two parts, 113 and 1084117, that multiplied together give a palindrome (122505221).
The spelling of 1131084117 in words is "one billion, one hundred thirty-one million, eighty-four thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •