Base | Representation |
---|---|
bin | 100001101111010… |
… | …1111100010110100 |
3 | 2220220022021212112 |
4 | 1003132233202310 |
5 | 4304311220112 |
6 | 304201310152 |
7 | 40024652636 |
oct | 10336574264 |
9 | 2826267775 |
10 | 1132132532 |
11 | 531071a23 |
12 | 277195358 |
13 | 15072150b |
14 | aa504a56 |
15 | 695d1a22 |
hex | 437af8b4 |
1132132532 has 12 divisors (see below), whose sum is σ = 1987484100. Its totient is φ = 564279936.
The previous prime is 1132132531. The next prime is 1132132541. The reversal of 1132132532 is 2352312311.
It can be written as a sum of positive squares in 2 ways, for example, as 629207056 + 502925476 = 25084^2 + 22426^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1132132498 and 1132132507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1132132531) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 445157 + ... + 447692.
It is an arithmetic number, because the mean of its divisors is an integer number (165623675).
Almost surely, 21132132532 is an apocalyptic number.
It is an amenable number.
1132132532 is a deficient number, since it is larger than the sum of its proper divisors (855351568).
1132132532 is a wasteful number, since it uses less digits than its factorization.
1132132532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 893170 (or 893168 counting only the distinct ones).
The product of its digits is 1080, while the sum is 23.
The square root of 1132132532 is about 33647.1771772908. The cubic root of 1132132532 is about 1042.2352478652.
Adding to 1132132532 its reverse (2352312311), we get a palindrome (3484444843).
The spelling of 1132132532 in words is "one billion, one hundred thirty-two million, one hundred thirty-two thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •