Base | Representation |
---|---|
bin | 1111110101111… |
… | …01011111001001 |
3 | 100021001212000111 |
4 | 13322331133021 |
5 | 233010143323 |
6 | 21104234321 |
7 | 3202413655 |
oct | 772753711 |
9 | 307055014 |
10 | 132896713 |
11 | 690202a4 |
12 | 3860b9a1 |
13 | 216c1111 |
14 | 13915a65 |
15 | ba01c0d |
hex | 7ebd7c9 |
132896713 has 8 divisors (see below), whose sum is σ = 134182368. Its totient is φ = 131615904.
The previous prime is 132896707. The next prime is 132896759. The reversal of 132896713 is 317698231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132896713 - 217 = 132765641 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132896513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 76270 + ... + 77992.
It is an arithmetic number, because the mean of its divisors is an integer number (16772796).
Almost surely, 2132896713 is an apocalyptic number.
It is an amenable number.
132896713 is a deficient number, since it is larger than the sum of its proper divisors (1285655).
132896713 is a wasteful number, since it uses less digits than its factorization.
With its predecessor (132896712) it forms an eRAP, since the sums of their prime factors are consecutive (2422 and 2423).
132896713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2423.
The product of its digits is 54432, while the sum is 40.
The square root of 132896713 is about 11528.0836655534. The cubic root of 132896713 is about 510.3147013230.
It can be divided in two parts, 13289 and 6713, that added together give a palindrome (20002).
The spelling of 132896713 in words is "one hundred thirty-two million, eight hundred ninety-six thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •