Base | Representation |
---|---|
bin | 1111110100000… |
… | …01100000100001 |
3 | 100020121101000112 |
4 | 13322001200201 |
5 | 232424313131 |
6 | 21055101105 |
7 | 3200341505 |
oct | 772014041 |
9 | 306541015 |
10 | 132651041 |
11 | 68972766 |
12 | 38511795 |
13 | 21636353 |
14 | 13890305 |
15 | b9a402b |
hex | 7e81821 |
132651041 has 4 divisors (see below), whose sum is σ = 132676500. Its totient is φ = 132625584.
The previous prime is 132651019. The next prime is 132651047. The reversal of 132651041 is 140156231.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 48011041 + 84640000 = 6929^2 + 9200^2 .
It is a cyclic number.
It is not a de Polignac number, because 132651041 - 214 = 132634657 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132650998 and 132651016.
It is not an unprimeable number, because it can be changed into a prime (132651047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1766 + ... + 16383.
It is an arithmetic number, because the mean of its divisors is an integer number (33169125).
Almost surely, 2132651041 is an apocalyptic number.
It is an amenable number.
132651041 is a deficient number, since it is larger than the sum of its proper divisors (25459).
132651041 is an equidigital number, since it uses as much as digits as its factorization.
132651041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25458.
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 132651041 is about 11517.4233663611. The cubic root of 132651041 is about 510.0000525439. Note that the first 4 decimals are identical.
The spelling of 132651041 in words is "one hundred thirty-two million, six hundred fifty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •