Base | Representation |
---|---|
bin | 1110000110010011111111… |
… | …11011000011110111101101 |
3 | 11001202212201201100210200201 |
4 | 13003021333323003313231 |
5 | 13030424043323200214 |
6 | 145534403244153501 |
7 | 6346623460662166 |
oct | 703117773036755 |
9 | 131685651323621 |
10 | 31003220131309 |
11 | 997343456a298 |
12 | 358876b838891 |
13 | 143b78b8a471a |
14 | 7927c733c76d |
15 | 38b6e90b8274 |
hex | 1c327fec3ded |
31003220131309 has 2 divisors, whose sum is σ = 31003220131310. Its totient is φ = 31003220131308.
The previous prime is 31003220131229. The next prime is 31003220131321. The reversal of 31003220131309 is 90313102230013.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 26352339703209 + 4650880428100 = 5133453^2 + 2156590^2 .
It is a cyclic number.
It is not a de Polignac number, because 31003220131309 - 225 = 31003186576877 is a prime.
It is a super-2 number, since 2×310032201313092 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31003220131339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15501610065654 + 15501610065655.
It is an arithmetic number, because the mean of its divisors is an integer number (15501610065655).
Almost surely, 231003220131309 is an apocalyptic number.
It is an amenable number.
31003220131309 is a deficient number, since it is larger than the sum of its proper divisors (1).
31003220131309 is an equidigital number, since it uses as much as digits as its factorization.
31003220131309 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 28.
The spelling of 31003220131309 in words is "thirty-one trillion, three billion, two hundred twenty million, one hundred thirty-one thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •