Base | Representation |
---|---|
bin | 11110000000101000101… |
… | …01011111111001010111 |
3 | 10122120112110021111202112 |
4 | 33000110111133321113 |
5 | 113343230113043111 |
6 | 2105410205501235 |
7 | 134332305461666 |
oct | 17002425377127 |
9 | 3576473244675 |
10 | 1031133331031 |
11 | 36833497a341 |
12 | 147a1057181b |
13 | 7630a3b17cb |
14 | 37c9b1c8ddd |
15 | 1bc4eb0be8b |
hex | f01455fe57 |
1031133331031 has 2 divisors, whose sum is σ = 1031133331032. Its totient is φ = 1031133331030.
The previous prime is 1031133331013. The next prime is 1031133331051. The reversal of 1031133331031 is 1301333311301.
Together with previous prime (1031133331013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1031133331031 - 214 = 1031133314647 is a prime.
It is a super-2 number, since 2×10311333310312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1031133330988 and 1031133331006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1031133331051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515566665515 + 515566665516.
It is an arithmetic number, because the mean of its divisors is an integer number (515566665516).
Almost surely, 21031133331031 is an apocalyptic number.
1031133331031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1031133331031 is an equidigital number, since it uses as much as digits as its factorization.
1031133331031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 729, while the sum is 23.
Adding to 1031133331031 its reverse (1301333311301), we get a palindrome (2332466642332).
The spelling of 1031133331031 in words is "one trillion, thirty-one billion, one hundred thirty-three million, three hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •