Base | Representation |
---|---|
bin | 11101110101010111110010… |
… | …011011111001000000100001 |
3 | 122012120122120211001020100202 |
4 | 131311113302123321000201 |
5 | 114144230133432320134 |
6 | 1143021302330354545 |
7 | 36431453322130106 |
oct | 3565276233710041 |
9 | 565518524036322 |
10 | 131211023323169 |
11 | 38898312002159 |
12 | 128716aa28ba55 |
13 | 582a1b987240a |
14 | 245890c708aad |
15 | 1028176dcdd7e |
hex | 7755f26f9021 |
131211023323169 has 2 divisors, whose sum is σ = 131211023323170. Its totient is φ = 131211023323168.
The previous prime is 131211023323147. The next prime is 131211023323267. The reversal of 131211023323169 is 961323320112131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 71718540942400 + 59492482380769 = 8468680^2 + 7713137^2 .
It is a cyclic number.
It is not a de Polignac number, because 131211023323169 - 212 = 131211023319073 is a prime.
It is a super-2 number, since 2×1312110233231692 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (131211023323129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65605511661584 + 65605511661585.
It is an arithmetic number, because the mean of its divisors is an integer number (65605511661585).
Almost surely, 2131211023323169 is an apocalyptic number.
It is an amenable number.
131211023323169 is a deficient number, since it is larger than the sum of its proper divisors (1).
131211023323169 is an equidigital number, since it uses as much as digits as its factorization.
131211023323169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34992, while the sum is 38.
The spelling of 131211023323169 in words is "one hundred thirty-one trillion, two hundred eleven billion, twenty-three million, three hundred twenty-three thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •