Base | Representation |
---|---|
bin | 1100010100000110110… |
… | …0111110011100010000 |
3 | 202020001200101101221020 |
4 | 3011001230332130100 |
5 | 11431231230103030 |
6 | 241104244555440 |
7 | 21166355556555 |
oct | 3050154763420 |
9 | 666050341836 |
10 | 211555706640 |
11 | 817a1754683 |
12 | 350016b2b80 |
13 | 16c46404605 |
14 | a34cac8a2c |
15 | 5782bd2510 |
hex | 3141b3e710 |
211555706640 has 160 divisors (see below), whose sum is σ = 665440551936. Its totient is φ = 55588431360.
The previous prime is 211555706617. The next prime is 211555706651. The reversal of 211555706640 is 46607555112.
It is a junction number, because it is equal to n+sod(n) for n = 211555706592 and 211555706601.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 52532307 + ... + 52536333.
Almost surely, 2211555706640 is an apocalyptic number.
211555706640 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 211555706640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (332720275968).
211555706640 is an abundant number, since it is smaller than the sum of its proper divisors (453884845296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211555706640 is a wasteful number, since it uses less digits than its factorization.
211555706640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7197 (or 7191 counting only the distinct ones).
The product of its (nonzero) digits is 252000, while the sum is 42.
The spelling of 211555706640 in words is "two hundred eleven billion, five hundred fifty-five million, seven hundred six thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •