Base | Representation |
---|---|
bin | 11101110101010111001000… |
… | …100001000011000100010001 |
3 | 122012120120202210200100021022 |
4 | 131311113020201003010101 |
5 | 114144222213412011032 |
6 | 1143021104444405225 |
7 | 36431430022220432 |
oct | 3565271041030421 |
9 | 565516683610238 |
10 | 131210320032017 |
11 | 38897a910150a6 |
12 | 12871532846815 |
13 | 582a106c4ccc5 |
14 | 2458883155489 |
15 | 10281352ab512 |
hex | 7755c8843111 |
131210320032017 has 2 divisors, whose sum is σ = 131210320032018. Its totient is φ = 131210320032016.
The previous prime is 131210320032007. The next prime is 131210320032073. The reversal of 131210320032017 is 710230023012131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 101646643344016 + 29563676688001 = 10081996^2 + 5437249^2 .
It is a cyclic number.
It is not a de Polignac number, because 131210320032017 - 26 = 131210320031953 is a prime.
It is a super-2 number, since 2×1312103200320172 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (131210320032007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65605160016008 + 65605160016009.
It is an arithmetic number, because the mean of its divisors is an integer number (65605160016009).
Almost surely, 2131210320032017 is an apocalyptic number.
It is an amenable number.
131210320032017 is a deficient number, since it is larger than the sum of its proper divisors (1).
131210320032017 is an equidigital number, since it uses as much as digits as its factorization.
131210320032017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1512, while the sum is 26.
Adding to 131210320032017 its reverse (710230023012131), we get a palindrome (841440343044148).
The spelling of 131210320032017 in words is "one hundred thirty-one trillion, two hundred ten billion, three hundred twenty million, thirty-two thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •