Base | Representation |
---|---|
bin | 111101011101011… |
… | …100110011000001 |
3 | 2122212020211212022 |
4 | 331131130303001 |
5 | 4102432132210 |
6 | 250152411225 |
7 | 34360314542 |
oct | 7535346301 |
9 | 2585224768 |
10 | 1031130305 |
11 | 48a056507 |
12 | 2493a6b15 |
13 | 13581979a |
14 | 9ad324c9 |
15 | 607d0155 |
hex | 3d75ccc1 |
1031130305 has 4 divisors (see below), whose sum is σ = 1237356372. Its totient is φ = 824904240.
The previous prime is 1031130271. The next prime is 1031130307. The reversal of 1031130305 is 5030311301.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 629809216 + 401321089 = 25096^2 + 20033^2 .
It is not a de Polignac number, because 1031130305 - 28 = 1031130049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1031130307) 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 3 ways as a sum of consecutive naturals, for example, 103113026 + ... + 103113035.
It is an arithmetic number, because the mean of its divisors is an integer number (309339093).
Almost surely, 21031130305 is an apocalyptic number.
It is an amenable number.
1031130305 is a deficient number, since it is larger than the sum of its proper divisors (206226067).
1031130305 is an equidigital number, since it uses as much as digits as its factorization.
1031130305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206226066.
The product of its (nonzero) digits is 135, while the sum is 17.
The square root of 1031130305 is about 32111.2177439598. The cubic root of 1031130305 is about 1010.2709154634.
Adding to 1031130305 its reverse (5030311301), we get a palindrome (6061441606).
The spelling of 1031130305 in words is "one billion, thirty-one million, one hundred thirty thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •