Base | Representation |
---|---|
bin | 11110001100011101… |
… | …110101011001011000 |
3 | 10002200111120212202002 |
4 | 132030131311121120 |
5 | 1012344334332300 |
6 | 22521051100132 |
7 | 2225301241325 |
oct | 361435653130 |
9 | 102614525662 |
10 | 32421402200 |
11 | 12828044380 |
12 | 6349a41648 |
13 | 3098c35475 |
14 | 17d7c79b4c |
15 | c9b4cb5d5 |
hex | 78c775658 |
32421402200 has 96 divisors (see below), whose sum is σ = 82325110320. Its totient is φ = 11776320000.
The previous prime is 32421402197. The next prime is 32421402241. The reversal of 32421402200 is 220412423.
It is a super-2 number, since 2×324214022002 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2062370 + ... + 2078030.
Almost surely, 232421402200 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 32421402200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41162555160).
32421402200 is an abundant number, since it is smaller than the sum of its proper divisors (49903708120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32421402200 is a wasteful number, since it uses less digits than its factorization.
32421402200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16629 (or 16620 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 20.
Adding to 32421402200 its reverse (220412423), we get a palindrome (32641814623).
The spelling of 32421402200 in words is "thirty-two billion, four hundred twenty-one million, four hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •