Base | Representation |
---|---|
bin | 111101110011010000… |
… | …0100001101110110100 |
3 | 110200120020010212001000 |
4 | 1323212200201232310 |
5 | 4133300333232312 |
6 | 140545151003300 |
7 | 12405555660612 |
oct | 1734640415664 |
9 | 420506125030 |
10 | 132716305332 |
11 | 51314992576 |
12 | 2187a509530 |
13 | c690879ab0 |
14 | 65d01446b2 |
15 | 36bb569adc |
hex | 1ee6821bb4 |
132716305332 has 48 divisors (see below), whose sum is σ = 370546953280. Its totient is φ = 40835785824.
The previous prime is 132716305303. The next prime is 132716305343. The reversal of 132716305332 is 233503617231.
132716305332 is a `hidden beast` number, since 1 + 3 + 2 + 7 + 16 + 305 + 332 = 666.
It is a super-2 number, since 2×1327163053322 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
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 15 ways as a sum of consecutive naturals, for example, 47262238 + ... + 47265045.
Almost surely, 2132716305332 is an apocalyptic number.
132716305332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
132716305332 is an abundant number, since it is smaller than the sum of its proper divisors (237830647948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132716305332 is a wasteful number, since it uses less digits than its factorization.
132716305332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94527309 (or 94527301 counting only the distinct ones).
The product of its (nonzero) digits is 68040, while the sum is 36.
The spelling of 132716305332 in words is "one hundred thirty-two billion, seven hundred sixteen million, three hundred five thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •