Base | Representation |
---|---|
bin | 1100010011001010000… |
… | …1111000011100001000 |
3 | 202012101221101002110202 |
4 | 3010302201320130020 |
5 | 11430221042441412 |
6 | 241023112431332 |
7 | 21160145025500 |
oct | 3046241703410 |
9 | 665357332422 |
10 | 211301140232 |
11 | 81680a92116 |
12 | 34b503a8548 |
13 | 16c057535c0 |
14 | a326d80a00 |
15 | 576a69a3c2 |
hex | 3132878708 |
211301140232 has 96 divisors (see below), whose sum is σ = 499897843200. Its totient is φ = 82990002816.
The previous prime is 211301140213. The next prime is 211301140241. The reversal of 211301140232 is 232041103112.
211301140232 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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, 559193 + ... + 857495.
It is an arithmetic number, because the mean of its divisors is an integer number (5207269200).
Almost surely, 2211301140232 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 211301140232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (249948921600).
211301140232 is an abundant number, since it is smaller than the sum of its proper divisors (288596702968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211301140232 is a wasteful number, since it uses less digits than its factorization.
211301140232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 298475 (or 298464 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 211301140232 its reverse (232041103112), we get a palindrome (443342243344).
The spelling of 211301140232 in words is "two hundred eleven billion, three hundred one million, one hundred forty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •