Base | Representation |
---|---|
bin | 11101110101011001110000… |
… | …000001011101000011000101 |
3 | 122012120212000122201212112211 |
4 | 131311121300001131003011 |
5 | 114144243442330301432 |
6 | 1143022251354543421 |
7 | 36431556455254144 |
oct | 3565316001350305 |
9 | 565525018655484 |
10 | 131213130322117 |
11 | 388991a33906a8 |
12 | 12871b97a37b71 |
13 | 582a464240b5c |
14 | 2458a6c49775b |
15 | 102824bd79d47 |
hex | 77567005d0c5 |
131213130322117 has 2 divisors, whose sum is σ = 131213130322118. Its totient is φ = 131213130322116.
The previous prime is 131213130322003. The next prime is 131213130322147. The reversal of 131213130322117 is 711223031312131.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 65817540065601 + 65395590256516 = 8112801^2 + 8086754^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131213130322117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131213130322147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65606565161058 + 65606565161059.
It is an arithmetic number, because the mean of its divisors is an integer number (65606565161059).
Almost surely, 2131213130322117 is an apocalyptic number.
It is an amenable number.
131213130322117 is a deficient number, since it is larger than the sum of its proper divisors (1).
131213130322117 is an equidigital number, since it uses as much as digits as its factorization.
131213130322117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4536, while the sum is 31.
Adding to 131213130322117 its reverse (711223031312131), we get a palindrome (842436161634248).
The spelling of 131213130322117 in words is "one hundred thirty-one trillion, two hundred thirteen billion, one hundred thirty million, three hundred twenty-two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •