Base | Representation |
---|---|
bin | 1100010010011010111… |
… | …0011111101101101000 |
3 | 202011220010202122002200 |
4 | 3010212232133231220 |
5 | 11424314344321412 |
6 | 240551320300200 |
7 | 21152221625634 |
oct | 3044656375550 |
9 | 664803678080 |
10 | 211103120232 |
11 | 8158a231824 |
12 | 34ab6011660 |
13 | 16ba37105c4 |
14 | a308955dc4 |
15 | 57580d29dc |
hex | 3126b9fb68 |
211103120232 has 192 divisors, whose sum is σ = 607550760960. Its totient is φ = 66102220800.
The previous prime is 211103120197. The next prime is 211103120257. The reversal of 211103120232 is 232021301112.
211103120232 is a `hidden beast` number, since 211 + 103 + 120 + 232 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 38233632 + ... + 38239152.
It is an arithmetic number, because the mean of its divisors is an integer number (3164326880).
Almost surely, 2211103120232 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 211103120232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (303775380480).
211103120232 is an abundant number, since it is smaller than the sum of its proper divisors (396447640728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211103120232 is a wasteful number, since it uses less digits than its factorization.
211103120232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6064 (or 6057 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 211103120232 its reverse (232021301112), we get a palindrome (443124421344).
The spelling of 211103120232 in words is "two hundred eleven billion, one hundred three million, one hundred twenty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •