Base | Representation |
---|---|
bin | 100001101100010… |
… | …1111101010000011 |
3 | 2220210100101221110 |
4 | 1003120233222003 |
5 | 4303410411011 |
6 | 304103454403 |
7 | 40005413451 |
oct | 10330575203 |
9 | 2823311843 |
10 | 1130560131 |
11 | 530198618 |
12 | 276757403 |
13 | 1502c08bc |
14 | aa2159d1 |
15 | 693c0ba6 |
hex | 4362fa83 |
1130560131 has 8 divisors (see below), whose sum is σ = 1512559440. Its totient is φ = 751133792.
The previous prime is 1130560121. The next prime is 1130560169. The reversal of 1130560131 is 1310650311.
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 1130560131 - 27 = 1130560003 is a prime.
It is a super-2 number, since 2×11305601312 = 2556332419613474322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1130560098 and 1130560107.
It is not an unprimeable number, because it can be changed into a prime (1130560121) 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, 642216 + ... + 643973.
It is an arithmetic number, because the mean of its divisors is an integer number (189069930).
Almost surely, 21130560131 is an apocalyptic number.
1130560131 is a deficient number, since it is larger than the sum of its proper divisors (381999309).
1130560131 is a wasteful number, since it uses less digits than its factorization.
1130560131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1286485.
The product of its (nonzero) digits is 270, while the sum is 21.
The square root of 1130560131 is about 33623.8030418928. The cubic root of 1130560131 is about 1041.7525096132.
The spelling of 1130560131 in words is "one billion, one hundred thirty million, five hundred sixty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •