Base | Representation |
---|---|
bin | 11110000010001011000… |
… | …11101101010000000101 |
3 | 10122122200000011220210012 |
4 | 33001011203231100011 |
5 | 113401423014424313 |
6 | 2110024145440005 |
7 | 134361623645243 |
oct | 17010543552005 |
9 | 3578600156705 |
10 | 1031959139333 |
11 | 368719038341 |
12 | 148001040005 |
13 | 7640c4cc785 |
14 | 37d38b51793 |
15 | 1bc9c380da8 |
hex | f0458ed405 |
1031959139333 has 2 divisors, whose sum is σ = 1031959139334. Its totient is φ = 1031959139332.
The previous prime is 1031959139317. The next prime is 1031959139353. The reversal of 1031959139333 is 3339319591301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 883408250404 + 148550888929 = 939898^2 + 385423^2 .
It is a cyclic number.
It is not a de Polignac number, because 1031959139333 - 24 = 1031959139317 is a prime.
It is a super-2 number, since 2×10319591393332 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1031959139353) 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 as a sum of consecutive naturals, namely, 515979569666 + 515979569667.
It is an arithmetic number, because the mean of its divisors is an integer number (515979569667).
Almost surely, 21031959139333 is an apocalyptic number.
It is an amenable number.
1031959139333 is a deficient number, since it is larger than the sum of its proper divisors (1).
1031959139333 is an equidigital number, since it uses as much as digits as its factorization.
1031959139333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 885735, while the sum is 50.
The spelling of 1031959139333 in words is "one trillion, thirty-one billion, nine hundred fifty-nine million, one hundred thirty-nine thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •