Base | Representation |
---|---|
bin | 100001101101011… |
… | …1001000101010111 |
3 | 2220211102000002121 |
4 | 1003122321011113 |
5 | 4304031414111 |
6 | 304123520411 |
7 | 40013246533 |
oct | 10332710527 |
9 | 2824360077 |
10 | 1131123031 |
11 | 530542525 |
12 | 276989107 |
13 | 150459b8c |
14 | aa320bc3 |
15 | 69482871 |
hex | 436b9157 |
1131123031 has 8 divisors (see below), whose sum is σ = 1149684224. Its totient is φ = 1112707800.
The previous prime is 1131123023. The next prime is 1131123053. The reversal of 1131123031 is 1303211311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1131123031 - 23 = 1131123023 is a prime.
It is a super-2 number, since 2×11311230312 = 2558878622517253922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1131122996 and 1131123014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1131123131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20811 + ... + 51916.
It is an arithmetic number, because the mean of its divisors is an integer number (143710528).
Almost surely, 21131123031 is an apocalyptic number.
1131123031 is a deficient number, since it is larger than the sum of its proper divisors (18561193).
1131123031 is a wasteful number, since it uses less digits than its factorization.
1131123031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72981.
The product of its (nonzero) digits is 54, while the sum is 16.
The square root of 1131123031 is about 33632.1725584298. The cubic root of 1131123031 is about 1041.9253753094.
Adding to 1131123031 its reverse (1303211311), we get a palindrome (2434334342).
The spelling of 1131123031 in words is "one billion, one hundred thirty-one million, one hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •