Base | Representation |
---|---|
bin | 100001101011111… |
… | …0010110101110111 |
3 | 2220202212202020112 |
4 | 1003113302311313 |
5 | 4303324423111 |
6 | 304054253235 |
7 | 40003325303 |
oct | 10327626567 |
9 | 2822782215 |
10 | 1130311031 |
11 | 530038453 |
12 | 27665721b |
13 | 1502343c5 |
14 | aa18cd03 |
15 | 69371e8b |
hex | 435f2d77 |
1130311031 has 2 divisors, whose sum is σ = 1130311032. Its totient is φ = 1130311030.
The previous prime is 1130310997. The next prime is 1130311051. The reversal of 1130311031 is 1301130311.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1130311031 - 214 = 1130294647 is a prime.
It is a super-2 number, since 2×11303110312 = 2555206053600565922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1130310997 and 1130311015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1130311051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 565155515 + 565155516.
It is an arithmetic number, because the mean of its divisors is an integer number (565155516).
Almost surely, 21130311031 is an apocalyptic number.
1130311031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1130311031 is an equidigital number, since it uses as much as digits as its factorization.
1130311031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 14.
The square root of 1130311031 is about 33620.0986167501. The cubic root of 1130311031 is about 1041.6759930841.
Adding to 1130311031 its reverse (1301130311), we get a palindrome (2431441342).
The spelling of 1130311031 in words is "one billion, one hundred thirty million, three hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •