Base | Representation |
---|---|
bin | 11101110111010010001010… |
… | …111001010110010100010101 |
3 | 122020001012202210021021200221 |
4 | 131313102022321112110111 |
5 | 114203403244112413414 |
6 | 1143201513544034341 |
7 | 36444114601144321 |
oct | 3567221271262425 |
9 | 566035683237627 |
10 | 131342430201109 |
11 | 38939014838526 |
12 | 128930621629b1 |
13 | 58396cc0631aa |
14 | 2461016996981 |
15 | 102b7b84e5224 |
hex | 77748ae56515 |
131342430201109 has 2 divisors, whose sum is σ = 131342430201110. Its totient is φ = 131342430201108.
The previous prime is 131342430200977. The next prime is 131342430201113. The reversal of 131342430201109 is 901102034243131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 120170859289009 + 11171570912100 = 10962247^2 + 3342390^2 .
It is a cyclic number.
It is not a de Polignac number, because 131342430201109 - 231 = 131340282717461 is a prime.
It is a super-2 number, since 2×1313424302011092 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131342430201179) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65671215100554 + 65671215100555.
It is an arithmetic number, because the mean of its divisors is an integer number (65671215100555).
Almost surely, 2131342430201109 is an apocalyptic number.
It is an amenable number.
131342430201109 is a deficient number, since it is larger than the sum of its proper divisors (1).
131342430201109 is an equidigital number, since it uses as much as digits as its factorization.
131342430201109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 34.
The spelling of 131342430201109 in words is "one hundred thirty-one trillion, three hundred forty-two billion, four hundred thirty million, two hundred one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •