Base | Representation |
---|---|
bin | 1111110100100… |
… | …00101101010101 |
3 | 100020201112102110 |
4 | 13322100231111 |
5 | 232433311201 |
6 | 21100301233 |
7 | 3201021150 |
oct | 772205525 |
9 | 306645373 |
10 | 132713301 |
11 | 68a05516 |
12 | 38541819 |
13 | 216587a6 |
14 | 138a8c97 |
15 | b9b76d6 |
hex | 7e90b55 |
132713301 has 8 divisors (see below), whose sum is σ = 202229824. Its totient is φ = 75836160.
The previous prime is 132713297. The next prime is 132713311. The reversal of 132713301 is 103317231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 132713301 - 22 = 132713297 is a prime.
It is a super-2 number, since 2×1327133012 = 35225640524633202, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 6319681 = 132713301 / (1 + 3 + 2 + 7 + 1 + 3 + 3 + 0 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132713311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3159820 + ... + 3159861.
It is an arithmetic number, because the mean of its divisors is an integer number (25278728).
Almost surely, 2132713301 is an apocalyptic number.
It is an amenable number.
132713301 is a deficient number, since it is larger than the sum of its proper divisors (69516523).
132713301 is an equidigital number, since it uses as much as digits as its factorization.
132713301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6319691.
The product of its (nonzero) digits is 378, while the sum is 21.
The square root of 132713301 is about 11520.1259107702. The cubic root of 132713301 is about 510.0798298720.
The spelling of 132713301 in words is "one hundred thirty-two million, seven hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •