Base | Representation |
---|---|
bin | 11101111010101111… |
… | …100010001000100000 |
3 | 10001220210001220221201 |
4 | 131322233202020200 |
5 | 1011242224131000 |
6 | 22431345530544 |
7 | 2215030636165 |
oct | 357257421040 |
9 | 101823056851 |
10 | 32124052000 |
11 | 1269520a807 |
12 | 6286343a54 |
13 | 304c4547c1 |
14 | 17aa59606c |
15 | c8034296a |
hex | 77abe2220 |
32124052000 has 144 divisors (see below), whose sum is σ = 79807821912. Its totient is φ = 12708057600.
The previous prime is 32124051997. The next prime is 32124052007. The reversal of 32124052000 is 25042123.
It can be written as a sum of positive squares in 4 ways, for example, as 11211421456 + 20912630544 = 105884^2 + 144612^2 .
It is not an unprimeable number, because it can be changed into a prime (32124052007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 42435622 + ... + 42436378.
Almost surely, 232124052000 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 32124052000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39903910956).
32124052000 is an abundant number, since it is smaller than the sum of its proper divisors (47683769912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32124052000 is an equidigital number, since it uses as much as digits as its factorization.
32124052000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 988 (or 867 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 19.
Adding to 32124052000 its reverse (25042123), we get a palindrome (32149094123).
The spelling of 32124052000 in words is "thirty-two billion, one hundred twenty-four million, fifty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •