Base | Representation |
---|---|
bin | 1111101101101… |
… | …01010101011001 |
3 | 100012000212211121 |
4 | 13312311111121 |
5 | 232221032440 |
6 | 21025125241 |
7 | 3160256356 |
oct | 766652531 |
9 | 305025747 |
10 | 131814745 |
11 | 68451407 |
12 | 38189821 |
13 | 214027ba |
14 | 1371362d |
15 | b88b34a |
hex | 7db5559 |
131814745 has 4 divisors (see below), whose sum is σ = 158177700. Its totient is φ = 105451792.
The previous prime is 131814731. The next prime is 131814803. The reversal of 131814745 is 547418131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 547418131 = 13 ⋅42109087.
It can be written as a sum of positive squares in 2 ways, for example, as 72386064 + 59428681 = 8508^2 + 7709^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131814745 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131814745.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 13181470 + ... + 13181479.
It is an arithmetic number, because the mean of its divisors is an integer number (39544425).
Almost surely, 2131814745 is an apocalyptic number.
It is an amenable number.
131814745 is a deficient number, since it is larger than the sum of its proper divisors (26362955).
131814745 is an equidigital number, since it uses as much as digits as its factorization.
131814745 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26362954.
The product of its digits is 13440, while the sum is 34.
The square root of 131814745 is about 11481.0602733371. The cubic root of 131814745 is about 508.9260303990.
The spelling of 131814745 in words is "one hundred thirty-one million, eight hundred fourteen thousand, seven hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •