Base | Representation |
---|---|
bin | 1111101100100… |
… | …01000111111101 |
3 | 100011202100101102 |
4 | 13312101013331 |
5 | 232201311204 |
6 | 21022022445 |
7 | 3156101066 |
oct | 766210775 |
9 | 304670342 |
10 | 131666429 |
11 | 6835aa34 |
12 | 38117a25 |
13 | 2138013b |
14 | 136b556d |
15 | b85c41e |
hex | 7d911fd |
131666429 has 2 divisors, whose sum is σ = 131666430. Its totient is φ = 131666428.
The previous prime is 131666419. The next prime is 131666443. The reversal of 131666429 is 924666131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 108722329 + 22944100 = 10427^2 + 4790^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131666429 is a prime.
It is a super-2 number, since 2×1316664292 = 34672097051224082, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 131666392 and 131666401.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131666419) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65833214 + 65833215.
It is an arithmetic number, because the mean of its divisors is an integer number (65833215).
Almost surely, 2131666429 is an apocalyptic number.
It is an amenable number.
131666429 is a deficient number, since it is larger than the sum of its proper divisors (1).
131666429 is an equidigital number, since it uses as much as digits as its factorization.
131666429 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 46656, while the sum is 38.
The square root of 131666429 is about 11474.5992958360. The cubic root of 131666429 is about 508.7350800841.
The spelling of 131666429 in words is "one hundred thirty-one million, six hundred sixty-six thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •