Base | Representation |
---|---|
bin | 100001101101010… |
… | …0111011100011101 |
3 | 2220211021022222200 |
4 | 1003122213130131 |
5 | 4304022111111 |
6 | 304122202113 |
7 | 40012526100 |
oct | 10332473435 |
9 | 2824238880 |
10 | 1131050781 |
11 | 5304a3213 |
12 | 276953339 |
13 | 150433023 |
14 | aa302737 |
15 | 6946b256 |
hex | 436a771d |
1131050781 has 18 divisors (see below), whose sum is σ = 1900473822. Its totient is φ = 646314480.
The previous prime is 1131050761. The next prime is 1131050819. The reversal of 1131050781 is 1870501311.
It can be written as a sum of positive squares in only one way, i.e., 901800900 + 229249881 = 30030^2 + 15141^2 .
It is not a de Polignac number, because 1131050781 - 27 = 1131050653 is a prime.
It is a super-2 number, since 2×11310507812 = 2558551738401419922, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1131050741) 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 17 ways as a sum of consecutive naturals, for example, 1281930 + ... + 1282811.
It is an arithmetic number, because the mean of its divisors is an integer number (105581879).
Almost surely, 21131050781 is an apocalyptic number.
It is an amenable number.
1131050781 is a deficient number, since it is larger than the sum of its proper divisors (769423041).
1131050781 is a wasteful number, since it uses less digits than its factorization.
1131050781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2564761 (or 2564751 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 27.
The square root of 1131050781 is about 33631.0984209556. The cubic root of 1131050781 is about 1041.9031906577.
The spelling of 1131050781 in words is "one billion, one hundred thirty-one million, fifty thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •