Base | Representation |
---|---|
bin | 111101101010100101… |
… | …1111101101100111000 |
3 | 110122210222022200111001 |
4 | 1323111023331230320 |
5 | 4132201434432300 |
6 | 140500250214344 |
7 | 12365426616301 |
oct | 1732513755470 |
9 | 418728280431 |
10 | 132425702200 |
11 | 511859470a0 |
12 | 217b91243b4 |
13 | c6455bc18c |
14 | 65a36d97a8 |
15 | 36a0cb516a |
hex | 1ed52fdb38 |
132425702200 has 144 divisors (see below), whose sum is σ = 354490157160. Its totient is φ = 45620064000.
The previous prime is 132425702183. The next prime is 132425702203. The reversal of 132425702200 is 2207524231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132425702203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 710830 + ... + 877570.
Almost surely, 2132425702200 is an apocalyptic number.
132425702200 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 132425702200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (177245078580).
132425702200 is an abundant number, since it is smaller than the sum of its proper divisors (222064454960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132425702200 is a wasteful number, since it uses less digits than its factorization.
132425702200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166806 (or 166778 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 28.
The spelling of 132425702200 in words is "one hundred thirty-two billion, four hundred twenty-five million, seven hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •