Base | Representation |
---|---|
bin | 111101101101000010… |
… | …0100100111110100000 |
3 | 110200000200112011110211 |
4 | 1323122010210332200 |
5 | 4132333424331000 |
6 | 140512334503504 |
7 | 12400443313063 |
oct | 1733204447640 |
9 | 420020464424 |
10 | 132507652000 |
11 | 5121812a1a9 |
12 | 21820664b94 |
13 | c659582b99 |
14 | 65b054c8da |
15 | 36a80a17ba |
hex | 1eda124fa0 |
132507652000 has 96 divisors (see below), whose sum is σ = 325770878160. Its totient is φ = 52970572800.
The previous prime is 132507651979. The next prime is 132507652007. The reversal of 132507652000 is 256705231.
It can be written as a sum of positive squares in 8 ways, for example, as 14768082576 + 117739569424 = 121524^2 + 343132^2 .
It is not an unprimeable number, because it can be changed into a prime (132507652007) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7146742 + ... + 7165258.
Almost surely, 2132507652000 is an apocalyptic number.
132507652000 is a gapful number since it is divisible by the number (10) 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 132507652000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (162885439080).
132507652000 is an abundant number, since it is smaller than the sum of its proper divisors (193263226160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132507652000 is a wasteful number, since it uses less digits than its factorization.
132507652000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20331 (or 20313 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 31.
The spelling of 132507652000 in words is "one hundred thirty-two billion, five hundred seven million, six hundred fifty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •