Base | Representation |
---|---|
bin | 101100001000000101000… |
… | …001001110111001001000 |
3 | 101201212222100222100120102 |
4 | 230020011001032321020 |
5 | 344140203231321300 |
6 | 10241011135344532 |
7 | 432035664146534 |
oct | 54100501167110 |
9 | 11655870870512 |
10 | 3032331120200 |
11 | a6a005956928 |
12 | 40b829682148 |
13 | 18cc41b44c65 |
14 | a6aa0b90bc4 |
15 | 53d27d3a0d5 |
hex | 2c20504ee48 |
3032331120200 has 96 divisors (see below), whose sum is σ = 7132747641600. Its totient is φ = 1198803836160.
The previous prime is 3032331120191. The next prime is 3032331120227. The reversal of 3032331120200 is 20211332303.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5954834 + ... + 6443966.
It is an arithmetic number, because the mean of its divisors is an integer number (74299454600).
Almost surely, 23032331120200 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 3032331120200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3566373820800).
3032331120200 is an abundant number, since it is smaller than the sum of its proper divisors (4100416521400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3032331120200 is a wasteful number, since it uses less digits than its factorization.
3032331120200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 489511 (or 489502 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 3032331120200 its reverse (20211332303), we get a palindrome (3052542452503).
The spelling of 3032331120200 in words is "three trillion, thirty-two billion, three hundred thirty-one million, one hundred twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •