Base | Representation |
---|---|
bin | 1111100111100… |
… | …01001001100001 |
3 | 100010112001112112 |
4 | 13303301021201 |
5 | 232014324134 |
6 | 21000005105 |
7 | 3150401522 |
oct | 763611141 |
9 | 303461475 |
10 | 131011169 |
11 | 67a526a3 |
12 | 37a60795 |
13 | 211b0b03 |
14 | 13584849 |
15 | b77d1ce |
hex | 7cf1261 |
131011169 has 2 divisors, whose sum is σ = 131011170. Its totient is φ = 131011168.
The previous prime is 131011123. The next prime is 131011187. The reversal of 131011169 is 961110131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 125776225 + 5234944 = 11215^2 + 2288^2 .
It is a cyclic number.
It is not a de Polignac number, because 131011169 - 220 = 129962593 is a prime.
It is a super-2 number, since 2×1310111692 = 34327852805493122, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (131011189) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65505584 + 65505585.
It is an arithmetic number, because the mean of its divisors is an integer number (65505585).
Almost surely, 2131011169 is an apocalyptic number.
It is an amenable number.
131011169 is a deficient number, since it is larger than the sum of its proper divisors (1).
131011169 is an equidigital number, since it uses as much as digits as its factorization.
131011169 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 162, while the sum is 23.
The square root of 131011169 is about 11446.0110518905. The cubic root of 131011169 is about 507.8897411418.
The spelling of 131011169 in words is "one hundred thirty-one million, eleven thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •