Base | Representation |
---|---|
bin | 1100010010111111100… |
… | …0111101101000000100 |
3 | 202012021212001101020022 |
4 | 3010233320331220010 |
5 | 11430123223443030 |
6 | 241014451354312 |
7 | 21156066450215 |
oct | 3045770755004 |
9 | 665255041208 |
10 | 211256859140 |
11 | 81658a98078 |
12 | 34b395b2998 |
13 | 16bc951b282 |
14 | a32113540c |
15 | 576684ede5 |
hex | 312fe3da04 |
211256859140 has 48 divisors (see below), whose sum is σ = 467059454400. Its totient is φ = 80043126912.
The previous prime is 211256859133. The next prime is 211256859157. The reversal of 211256859140 is 41958652112.
211256859140 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 211256859091 and 211256859100.
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 15 ways as a sum of consecutive naturals, for example, 2711651 + ... + 2788469.
It is an arithmetic number, because the mean of its divisors is an integer number (9730405300).
Almost surely, 2211256859140 is an apocalyptic number.
211256859140 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211256859140 is an abundant number, since it is smaller than the sum of its proper divisors (255802595260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211256859140 is a wasteful number, since it uses less digits than its factorization.
211256859140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84084 (or 84082 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 44.
The spelling of 211256859140 in words is "two hundred eleven billion, two hundred fifty-six million, eight hundred fifty-nine thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •