Base | Representation |
---|---|
bin | 111101011101010… |
… | …001000101001001 |
3 | 2122212011102000211 |
4 | 331131101011021 |
5 | 4102424113223 |
6 | 250151401121 |
7 | 34360024612 |
oct | 7535210511 |
9 | 2585142024 |
10 | 1031082313 |
11 | 48a023448 |
12 | 2493831a1 |
13 | 1358009a1 |
14 | 9ad1cc09 |
15 | 607c0d0d |
hex | 3d751149 |
1031082313 has 2 divisors, whose sum is σ = 1031082314. Its totient is φ = 1031082312.
The previous prime is 1031082259. The next prime is 1031082331. The reversal of 1031082313 is 3132801301.
1031082313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (1031082331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 983637769 + 47444544 = 31363^2 + 6888^2 .
It is a cyclic number.
It is not a de Polignac number, because 1031082313 - 29 = 1031081801 is a prime.
It is not a weakly prime, because it can be changed into another prime (1031082713) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515541156 + 515541157.
It is an arithmetic number, because the mean of its divisors is an integer number (515541157).
Almost surely, 21031082313 is an apocalyptic number.
It is an amenable number.
1031082313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1031082313 is an equidigital number, since it uses as much as digits as its factorization.
1031082313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
The square root of 1031082313 is about 32110.4704574692. The cubic root of 1031082313 is about 1010.2552415071.
Adding to 1031082313 its reverse (3132801301), we get a palindrome (4163883614).
The spelling of 1031082313 in words is "one billion, thirty-one million, eighty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •