Base | Representation |
---|---|
bin | 1111110100100… |
… | …00100110111111 |
3 | 100020201111212102 |
4 | 13322100212333 |
5 | 232433303040 |
6 | 21100255315 |
7 | 3201020030 |
oct | 772204677 |
9 | 306644772 |
10 | 132712895 |
11 | 68a05187 |
12 | 3854153b |
13 | 21658553 |
14 | 138a8a87 |
15 | b9b7515 |
hex | 7e909bf |
132712895 has 16 divisors (see below), whose sum is σ = 186927168. Its totient is φ = 88542720.
The previous prime is 132712883. The next prime is 132712907. The reversal of 132712895 is 598217231.
It is an interprime number because it is at equal distance from previous prime (132712883) and next prime (132712907).
It is not a de Polignac number, because 132712895 - 214 = 132696511 is a prime.
It is a super-2 number, since 2×1327128952 = 35225424998562050, which contains 22 as substring.
It is a Smith number, since the sum of its digits (38) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 49946 + ... + 52535.
It is an arithmetic number, because the mean of its divisors is an integer number (11682948).
Almost surely, 2132712895 is an apocalyptic number.
132712895 is a deficient number, since it is larger than the sum of its proper divisors (54214273).
132712895 is a wasteful number, since it uses less digits than its factorization.
132712895 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102530.
The product of its digits is 30240, while the sum is 38.
The square root of 132712895 is about 11520.1082894216. The cubic root of 132712895 is about 510.0793097216.
The spelling of 132712895 in words is "one hundred thirty-two million, seven hundred twelve thousand, eight hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •