Base | Representation |
---|---|
bin | 11101110010111100100111… |
… | …101001010111000101111001 |
3 | 122011222201112102001102212221 |
4 | 131302330213221113011321 |
5 | 114134012424023302134 |
6 | 1142412545534404041 |
7 | 36413434462030363 |
oct | 3562744751270571 |
9 | 564881472042787 |
10 | 131044412322169 |
11 | 38833694487105 |
12 | 12845350660621 |
13 | 5817586a8baa8 |
14 | 2450824bb7d33 |
15 | 1023b74d665b4 |
hex | 772f27a57179 |
131044412322169 has 2 divisors, whose sum is σ = 131044412322170. Its totient is φ = 131044412322168.
The previous prime is 131044412322167. The next prime is 131044412322179. The reversal of 131044412322169 is 961223214440131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 114026411239225 + 17018001082944 = 10678315^2 + 4125288^2 .
It is a cyclic number.
It is not a de Polignac number, because 131044412322169 - 21 = 131044412322167 is a prime.
It is a super-2 number, since 2×1310444123221692 (a number of 29 digits) contains 22 as substring.
Together with 131044412322167, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (131044412322167) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65522206161084 + 65522206161085.
It is an arithmetic number, because the mean of its divisors is an integer number (65522206161085).
Almost surely, 2131044412322169 is an apocalyptic number.
It is an amenable number.
131044412322169 is a deficient number, since it is larger than the sum of its proper divisors (1).
131044412322169 is an equidigital number, since it uses as much as digits as its factorization.
131044412322169 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 248832, while the sum is 43.
The spelling of 131044412322169 in words is "one hundred thirty-one trillion, forty-four billion, four hundred twelve million, three hundred twenty-two thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •