Base | Representation |
---|---|
bin | 1111101000010… |
… | …10000001101101 |
3 | 100010201020022121 |
4 | 13310022001231 |
5 | 232031104234 |
6 | 21002112541 |
7 | 3151304563 |
oct | 764120155 |
9 | 303636277 |
10 | 131113069 |
11 | 6801220a |
12 | 37aab751 |
13 | 212182c9 |
14 | 135ada33 |
15 | b79d4b4 |
hex | 7d0a06d |
131113069 has 2 divisors, whose sum is σ = 131113070. Its totient is φ = 131113068.
The previous prime is 131113019. The next prime is 131113093. The reversal of 131113069 is 960311131.
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., 104796169 + 26316900 = 10237^2 + 5130^2 .
It is a cyclic number.
It is not a de Polignac number, because 131113069 - 213 = 131104877 is a prime.
It is a super-2 number, since 2×1311130692 = 34381273725197522, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131113009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65556534 + 65556535.
It is an arithmetic number, because the mean of its divisors is an integer number (65556535).
Almost surely, 2131113069 is an apocalyptic number.
It is an amenable number.
131113069 is a deficient number, since it is larger than the sum of its proper divisors (1).
131113069 is an equidigital number, since it uses as much as digits as its factorization.
131113069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 25.
The square root of 131113069 is about 11450.4615190830. The cubic root of 131113069 is about 508.0213852675.
The spelling of 131113069 in words is "one hundred thirty-one million, one hundred thirteen thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •