Base | Representation |
---|---|
bin | 1111101101000… |
… | …00000110011001 |
3 | 100011212110112021 |
4 | 13312200012121 |
5 | 232210242034 |
6 | 21023214441 |
7 | 3156444655 |
oct | 766400631 |
9 | 304773467 |
10 | 131727769 |
11 | 683a2028 |
12 | 38147421 |
13 | 213a2034 |
14 | 136cda65 |
15 | b8706b4 |
hex | 7da0199 |
131727769 has 2 divisors, whose sum is σ = 131727770. Its totient is φ = 131727768.
The previous prime is 131727721. The next prime is 131727787. The reversal of 131727769 is 967727131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 122655625 + 9072144 = 11075^2 + 3012^2 .
It is a cyclic number.
It is not a de Polignac number, because 131727769 - 211 = 131725721 is a prime.
It is a super-3 number, since 3×1317277693 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (131727709) 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, 65863884 + 65863885.
It is an arithmetic number, because the mean of its divisors is an integer number (65863885).
Almost surely, 2131727769 is an apocalyptic number.
It is an amenable number.
131727769 is a deficient number, since it is larger than the sum of its proper divisors (1).
131727769 is an equidigital number, since it uses as much as digits as its factorization.
131727769 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 111132, while the sum is 43.
The square root of 131727769 is about 11477.2718448244. The cubic root of 131727769 is about 508.8140700117.
It can be divided in two parts, 131727 and 769, that added together give a square (132496 = 3642).
The spelling of 131727769 in words is "one hundred thirty-one million, seven hundred twenty-seven thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •