Base | Representation |
---|---|
bin | 1111110000010… |
… | …00111010000101 |
3 | 100012200021101222 |
4 | 13320020322011 |
5 | 232313011221 |
6 | 21040330125 |
7 | 3163213361 |
oct | 770107205 |
9 | 305607358 |
10 | 132157061 |
11 | 68665613 |
12 | 38313945 |
13 | 214c255a |
14 | 137a22a1 |
15 | b9079ab |
hex | 7e08e85 |
132157061 has 4 divisors (see below), whose sum is σ = 136420224. Its totient is φ = 127893900.
The previous prime is 132157021. The next prime is 132157087. The reversal of 132157061 is 160751231.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 132157061 - 226 = 65048197 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 132157061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132157001) 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, 2131535 + ... + 2131596.
It is an arithmetic number, because the mean of its divisors is an integer number (34105056).
Almost surely, 2132157061 is an apocalyptic number.
It is an amenable number.
132157061 is a deficient number, since it is larger than the sum of its proper divisors (4263163).
132157061 is an equidigital number, since it uses as much as digits as its factorization.
132157061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4263162.
The product of its (nonzero) digits is 1260, while the sum is 26.
The square root of 132157061 is about 11495.9584637385. The cubic root of 132157061 is about 509.3662010148.
The spelling of 132157061 in words is "one hundred thirty-two million, one hundred fifty-seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •