Base | Representation |
---|---|
bin | 100001101011100… |
… | …0010000000110111 |
3 | 2220202111120220010 |
4 | 1003113002000313 |
5 | 4303302023111 |
6 | 304050111303 |
7 | 40001533230 |
oct | 10327020067 |
9 | 2822446803 |
10 | 1130111031 |
11 | 52aa11165 |
12 | 27657b533 |
13 | 15019436a |
14 | aa13a087 |
15 | 69332aa6 |
hex | 435c2037 |
1130111031 has 16 divisors (see below), whose sum is σ = 1722700544. Its totient is φ = 645542784.
The previous prime is 1130110991. The next prime is 1130111041. The reversal of 1130111031 is 1301110311.
It is not a de Polignac number, because 1130111031 - 217 = 1129979959 is a prime.
It is a super-2 number, since 2×11301110312 = 2554301884775765922, 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 = 1130110998 and 1130111016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130111041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 61311 + ... + 77583.
It is an arithmetic number, because the mean of its divisors is an integer number (107668784).
Almost surely, 21130111031 is an apocalyptic number.
1130111031 is a deficient number, since it is larger than the sum of its proper divisors (592589513).
1130111031 is a wasteful number, since it uses less digits than its factorization.
1130111031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19590.
The product of its (nonzero) digits is 9, while the sum is 12.
The square root of 1130111031 is about 33617.1240739002. The cubic root of 1130111031 is about 1041.6145505602.
Adding to 1130111031 its reverse (1301110311), we get a palindrome (2431221342).
The spelling of 1130111031 in words is "one billion, one hundred thirty million, one hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •