Base | Representation |
---|---|
bin | 111101000001000010… |
… | …0110000001101011001 |
3 | 110112012210111212101021 |
4 | 1322002010300031121 |
5 | 4121323003144001 |
6 | 140110035322441 |
7 | 12316035461434 |
oct | 1720204601531 |
9 | 415183455337 |
10 | 131031303001 |
11 | 5062a833365 |
12 | 2148a150421 |
13 | c482751ab1 |
14 | 64b044481b |
15 | 361d679ba1 |
hex | 1e82130359 |
131031303001 has 2 divisors, whose sum is σ = 131031303002. Its totient is φ = 131031303000.
The previous prime is 131031302981. The next prime is 131031303017. The reversal of 131031303001 is 100303130131.
It is an a-pointer prime, because the next prime (131031303017) can be obtained adding 131031303001 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100257723225 + 30773579776 = 316635^2 + 175424^2 .
It is a cyclic number.
It is not a de Polignac number, because 131031303001 - 219 = 131030778713 is a prime.
It is a super-2 number, since 2×1310313030012 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (131031403001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65515651500 + 65515651501.
It is an arithmetic number, because the mean of its divisors is an integer number (65515651501).
Almost surely, 2131031303001 is an apocalyptic number.
It is an amenable number.
131031303001 is a deficient number, since it is larger than the sum of its proper divisors (1).
131031303001 is an equidigital number, since it uses as much as digits as its factorization.
131031303001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 16.
Adding to 131031303001 its reverse (100303130131), we get a palindrome (231334433132).
The spelling of 131031303001 in words is "one hundred thirty-one billion, thirty-one million, three hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •