Base | Representation |
---|---|
bin | 1111101100010… |
… | …00000110101001 |
3 | 100011200110200222 |
4 | 13312020012221 |
5 | 232144120411 |
6 | 21021135425 |
7 | 3155555264 |
oct | 766100651 |
9 | 304613628 |
10 | 131629481 |
11 | 683351a5 |
12 | 380ba575 |
13 | 21369389 |
14 | 136a5cdb |
15 | b8514db |
hex | 7d881a9 |
131629481 has 2 divisors, whose sum is σ = 131629482. Its totient is φ = 131629480.
The previous prime is 131629457. The next prime is 131629513. The reversal of 131629481 is 184926131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 124121881 + 7507600 = 11141^2 + 2740^2 .
It is a cyclic number.
It is not a de Polignac number, because 131629481 - 222 = 127435177 is a prime.
It is a super-2 number, since 2×1316294812 = 34652640536658722, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (131629411) 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, 65814740 + 65814741.
It is an arithmetic number, because the mean of its divisors is an integer number (65814741).
Almost surely, 2131629481 is an apocalyptic number.
It is an amenable number.
131629481 is a deficient number, since it is larger than the sum of its proper divisors (1).
131629481 is an equidigital number, since it uses as much as digits as its factorization.
131629481 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10368, while the sum is 35.
The square root of 131629481 is about 11472.9891920109. The cubic root of 131629481 is about 508.6874888533.
The spelling of 131629481 in words is "one hundred thirty-one million, six hundred twenty-nine thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •