Base | Representation |
---|---|
bin | 1111101010000… |
… | …01110000010101 |
3 | 100011010211102211 |
4 | 13311001300111 |
5 | 232110410313 |
6 | 21011033421 |
7 | 3153245224 |
oct | 765016025 |
9 | 304124384 |
10 | 131341333 |
11 | 68158762 |
12 | 37b9b871 |
13 | 21298186 |
14 | 1362ccbb |
15 | b7e5e3d |
hex | 7d41c15 |
131341333 has 4 divisors (see below), whose sum is σ = 132178060. Its totient is φ = 130504608.
The previous prime is 131341283. The next prime is 131341349. The reversal of 131341333 is 333143131.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 79602084 + 51739249 = 8922^2 + 7193^2 .
It is a cyclic number.
It is not a de Polignac number, because 131341333 - 29 = 131340821 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131341033) 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 in 3 ways as a sum of consecutive naturals, for example, 418128 + ... + 418441.
It is an arithmetic number, because the mean of its divisors is an integer number (33044515).
Almost surely, 2131341333 is an apocalyptic number.
It is an amenable number.
131341333 is a deficient number, since it is larger than the sum of its proper divisors (836727).
131341333 is an equidigital number, since it uses as much as digits as its factorization.
131341333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 836726.
The product of its digits is 972, while the sum is 22.
The square root of 131341333 is about 11460.4246430924. The cubic root of 131341333 is about 508.3160311110.
Adding to 131341333 its reverse (333143131), we get a palindrome (464484464).
The spelling of 131341333 in words is "one hundred thirty-one million, three hundred forty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •