Base | Representation |
---|---|
bin | 100001001111101… |
… | …1111100110000011 |
3 | 2212202002220211121 |
4 | 1002133133212003 |
5 | 4241040132011 |
6 | 302410053111 |
7 | 36434015401 |
oct | 10237374603 |
9 | 2782086747 |
10 | 1115552131 |
11 | 522777911 |
12 | 27171a197 |
13 | 14a167725 |
14 | a822a471 |
15 | 67e08e71 |
hex | 427df983 |
1115552131 has 2 divisors, whose sum is σ = 1115552132. Its totient is φ = 1115552130.
The previous prime is 1115552093. The next prime is 1115552167. The reversal of 1115552131 is 1312555111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1115552131 - 225 = 1081997699 is a prime.
It is a super-3 number, since 3×11155521313 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 1115552096 and 1115552105.
It is not a weakly prime, because it can be changed into another prime (1115552531) 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, 557776065 + 557776066.
It is an arithmetic number, because the mean of its divisors is an integer number (557776066).
Almost surely, 21115552131 is an apocalyptic number.
1115552131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1115552131 is an equidigital number, since it uses as much as digits as its factorization.
1115552131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 750, while the sum is 25.
The square root of 1115552131 is about 33399.8822003911. The cubic root of 1115552131 is about 1037.1222623722.
The spelling of 1115552131 in words is "one billion, one hundred fifteen million, five hundred fifty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •