Base | Representation |
---|---|
bin | 11101111111010101… |
… | …011111100111010100 |
3 | 10002010011001222102112 |
4 | 131333111133213110 |
5 | 1011421441041040 |
6 | 22443141330152 |
7 | 2216654636030 |
oct | 357725374724 |
9 | 102104058375 |
10 | 32201112020 |
11 | 12724763080 |
12 | 62a8106958 |
13 | 30623c594c |
14 | 17b68d51c0 |
15 | c86eb5365 |
hex | 77f55f9d4 |
32201112020 has 192 divisors, whose sum is σ = 89744288256. Its totient is φ = 9395896320.
The previous prime is 32201111989. The next prime is 32201112043. The reversal of 32201112020 is 2021110223.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 32201111986 and 32201112004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5049554 + ... + 5055926.
It is an arithmetic number, because the mean of its divisors is an integer number (467418168).
Almost surely, 232201112020 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 32201112020, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44872144128).
32201112020 is an abundant number, since it is smaller than the sum of its proper divisors (57543176236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32201112020 is a wasteful number, since it uses less digits than its factorization.
32201112020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6610 (or 6608 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 32201112020 its reverse (2021110223), we get a palindrome (34222222243).
The spelling of 32201112020 in words is "thirty-two billion, two hundred one million, one hundred twelve thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •