Base | Representation |
---|---|
bin | 10000011110010000100… |
… | …001000111111101110100 |
3 | 11000012220002121001220022 |
4 | 100132100201013331310 |
5 | 122021314224020312 |
6 | 2224011210024312 |
7 | 144533016515345 |
oct | 20362041077564 |
9 | 4005802531808 |
10 | 1132001001332 |
11 | 3a7096065a33 |
12 | 163480a18098 |
13 | 829938a8416 |
14 | 3cb0958c0cc |
15 | 1e6a50d9172 |
hex | 10790847f74 |
1132001001332 has 24 divisors (see below), whose sum is σ = 2097672288264. Its totient is φ = 532670538752.
The previous prime is 1132001001259. The next prime is 1132001001359. The reversal of 1132001001332 is 2331001002311.
It can be written as a sum of positive squares in 4 ways, for example, as 7730981476 + 1124270019856 = 87926^2 + 1060316^2 .
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 1132001001332.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 473168 + ... + 1577304.
It is an arithmetic number, because the mean of its divisors is an integer number (87403012011).
Almost surely, 21132001001332 is an apocalyptic number.
It is an amenable number.
1132001001332 is a deficient number, since it is larger than the sum of its proper divisors (965671286932).
1132001001332 is a wasteful number, since it uses less digits than its factorization.
1132001001332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1119235 (or 1119233 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1132001001332 its reverse (2331001002311), we get a palindrome (3463002003643).
The spelling of 1132001001332 in words is "one trillion, one hundred thirty-two billion, one million, one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •