Base | Representation |
---|---|
bin | 111101110001110100… |
… | …0000000000000000000 |
3 | 110200102212010021020000 |
4 | 1323203220000000000 |
5 | 4133200442321142 |
6 | 140540302120000 |
7 | 12404430551502 |
oct | 1734350000000 |
9 | 420385107200 |
10 | 132667932672 |
11 | 5129a653470 |
12 | 21866280000 |
13 | c683841312 |
14 | 65c7951d72 |
15 | 36b71b214c |
hex | 1ee3a00000 |
132667932672 has 440 divisors, whose sum is σ = 438489212832. Its totient is φ = 39636172800.
The previous prime is 132667932653. The next prime is 132667932713. The reversal of 132667932672 is 276239766231.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
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 19 ways as a sum of consecutive naturals, for example, 1868562397 + ... + 1868562467.
Almost surely, 2132667932672 is an apocalyptic number.
132667932672 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 132667932672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (219244606416).
132667932672 is an abundant number, since it is smaller than the sum of its proper divisors (305821280160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132667932672 is an frugal number, since it uses more digits than its factorization.
132667932672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136 (or 87 counting only the distinct ones).
The product of its digits is 6858432, while the sum is 54.
The spelling of 132667932672 in words is "one hundred thirty-two billion, six hundred sixty-seven million, nine hundred thirty-two thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •